YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:26:53,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:26:53,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:26:53,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:26:53,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:26:53,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:26:53,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:26:53,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:26:53,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:26:53,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:26:53,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:26:53,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:26:53,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:26:53,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:26:53,535 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:26:53,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:26:53,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:26:53,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:26:53,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:26:53,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:26:53,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:26:53,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:26:53,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:26:53,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:26:53,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:26:53,547 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:26:53,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:26:53,548 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:26:53,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:26:53,549 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:26:53,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:26:53,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:26:53,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:26:53,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:26:53,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:26:53,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:26:53,553 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:26:53,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:26:53,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:26:53,554 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:26:53,569 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:26:53,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:26:53,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:26:53,570 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:26:53,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:26:53,570 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:26:53,571 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:26:53,571 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:26:53,571 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:26:53,571 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:26:53,571 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:26:53,571 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:26:53,572 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:26:53,572 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:26:53,572 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:26:53,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:26:53,572 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:26:53,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:26:53,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:26:53,573 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:26:53,573 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:26:53,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:26:53,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:26:53,574 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:26:53,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:26:53,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:26:53,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:26:53,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:26:53,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:26:53,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:26:53,613 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:26:53,616 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:26:53,617 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:26:53,618 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:26:53,619 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:26:53,687 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9034a41538384b6d8298affc5fd101b8/FLAG9d56bb2ec !SESSION 2020-06-22 10:26:51.179 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 10:26:53.960 !MESSAGE Indexed 'FLAG9d56bb2ec' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 10:26:54,040 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:26:54,041 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:26:54,041 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:26:54,047 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9034a41538384b6d8298affc5fd101b8/FLAG9d56bb2ec [2020-06-22 10:26:54,493 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9034a41538384b6d8298affc5fd101b8 [2020-06-22 10:26:54,505 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:26:54,507 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:26:54,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:26:54,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:26:54,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:26:54,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10974114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54, skipping insertion in model container [2020-06-22 10:26:54,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:26:54,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:26:54,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:26:54,767 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:26:54,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:26:54,801 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:26:54,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54 WrapperNode [2020-06-22 10:26:54,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:26:54,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:26:54,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:26:54,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:26:54,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:26:54,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:26:54,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:26:54,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:26:54,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... [2020-06-22 10:26:54,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:26:54,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:26:54,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:26:54,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:26:54,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:26:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:26:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:26:54,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:26:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:26:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:26:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:26:55,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:26:55,157 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:26:55,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:55 BoogieIcfgContainer [2020-06-22 10:26:55,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:26:55,159 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:26:55,159 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:26:55,161 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:26:55,162 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:55" (1/1) ... [2020-06-22 10:26:55,178 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 38 edges [2020-06-22 10:26:55,180 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:26:55,180 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:26:55,181 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:26:55,181 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:26:55,183 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:26:55,184 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:26:55,184 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:26:55,204 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:26:55,227 INFO L200 BlockEncoder]: SBE split 10 edges [2020-06-22 10:26:55,232 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 10:26:55,234 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:26:55,265 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:26:55,268 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 10:26:55,270 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:26:55,270 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:26:55,270 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:26:55,271 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:26:55,271 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges [2020-06-22 10:26:55,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:55 BasicIcfg [2020-06-22 10:26:55,272 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:26:55,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:26:55,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:26:55,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:26:55,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:26:54" (1/4) ... [2020-06-22 10:26:55,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3974b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:26:55, skipping insertion in model container [2020-06-22 10:26:55,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (2/4) ... [2020-06-22 10:26:55,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3974b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:26:55, skipping insertion in model container [2020-06-22 10:26:55,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:55" (3/4) ... [2020-06-22 10:26:55,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3974b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:26:55, skipping insertion in model container [2020-06-22 10:26:55,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:55" (4/4) ... [2020-06-22 10:26:55,280 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:26:55,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:26:55,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 10:26:55,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 10:26:55,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:26:55,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:26:55,343 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:26:55,344 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:26:55,344 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:26:55,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:26:55,344 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:26:55,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:26:55,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:26:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-06-22 10:26:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:55,365 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:55,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:55,366 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1674118285, now seen corresponding path program 1 times [2020-06-22 10:26:55,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:55,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:55,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:55,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:55,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:55,545 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-06-22 10:26:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:55,690 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2020-06-22 10:26:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:55,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:26:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:55,706 INFO L225 Difference]: With dead ends: 53 [2020-06-22 10:26:55,706 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 10:26:55,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 10:26:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2020-06-22 10:26:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:26:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2020-06-22 10:26:55,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 7 [2020-06-22 10:26:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:55,750 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 10:26:55,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2020-06-22 10:26:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:55,751 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:55,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:55,751 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088494, now seen corresponding path program 1 times [2020-06-22 10:26:55,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:55,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:55,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:55,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:55,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:55,795 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 3 states. [2020-06-22 10:26:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:55,842 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2020-06-22 10:26:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:55,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:26:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:55,843 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:26:55,843 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:26:55,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:26:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:26:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:26:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-06-22 10:26:55,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 7 [2020-06-22 10:26:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:55,848 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2020-06-22 10:26:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2020-06-22 10:26:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:55,849 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:55,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:55,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088492, now seen corresponding path program 1 times [2020-06-22 10:26:55,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:55,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:55,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:55,887 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. [2020-06-22 10:26:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:55,958 INFO L93 Difference]: Finished difference Result 41 states and 69 transitions. [2020-06-22 10:26:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:55,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:26:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:55,960 INFO L225 Difference]: With dead ends: 41 [2020-06-22 10:26:55,960 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:26:55,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:26:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2020-06-22 10:26:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:26:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2020-06-22 10:26:55,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 7 [2020-06-22 10:26:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:55,965 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. [2020-06-22 10:26:55,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. [2020-06-22 10:26:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:55,966 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:55,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:55,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088491, now seen corresponding path program 1 times [2020-06-22 10:26:55,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,030 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 4 states. [2020-06-22 10:26:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,111 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-06-22 10:26:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:56,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:26:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,113 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:26:56,113 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:26:56,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:26:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:26:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:26:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:26:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 10:26:56,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 7 [2020-06-22 10:26:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,117 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 10:26:56,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-06-22 10:26:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:56,118 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:56,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:56,118 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1674028038, now seen corresponding path program 1 times [2020-06-22 10:26:56,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:56,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:26:56,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,148 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 4 states. [2020-06-22 10:26:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,202 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-06-22 10:26:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:56,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:26:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,203 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:26:56,203 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:26:56,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:26:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:26:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:26:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 10:26:56,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 7 [2020-06-22 10:26:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,208 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 10:26:56,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2020-06-22 10:26:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:56,209 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:56,209 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:56,209 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 390572558, now seen corresponding path program 1 times [2020-06-22 10:26:56,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:56,238 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2020-06-22 10:26:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,292 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 10:26:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:56,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 10:26:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,293 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:26:56,312 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:26:56,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:26:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-06-22 10:26:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:26:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-06-22 10:26:56,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 10 [2020-06-22 10:26:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,317 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 10:26:56,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 26 transitions. [2020-06-22 10:26:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:56,318 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:56,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:56,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 390633012, now seen corresponding path program 1 times [2020-06-22 10:26:56,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:56,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:56,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:26:56,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:26:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:26:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:26:56,368 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. Second operand 5 states. [2020-06-22 10:26:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,460 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-06-22 10:26:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:26:56,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:26:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,461 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:26:56,461 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:26:56,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:26:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:26:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:26:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:26:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-06-22 10:26:56,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 10 [2020-06-22 10:26:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 10:26:56,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:26:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-06-22 10:26:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:56,467 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:56,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:56,467 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 390633013, now seen corresponding path program 1 times [2020-06-22 10:26:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:26:56,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,508 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 4 states. [2020-06-22 10:26:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,569 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-06-22 10:26:56,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:56,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 10:26:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,570 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:26:56,570 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:26:56,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:26:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 10:26:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:26:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-06-22 10:26:56,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 10 [2020-06-22 10:26:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,577 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-06-22 10:26:56,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-06-22 10:26:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 10:26:56,578 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:56,578 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:56,578 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:26:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2014379630, now seen corresponding path program 1 times [2020-06-22 10:26:56,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:26:56,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:56,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:56,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:56,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,613 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 4 states. [2020-06-22 10:26:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:56,658 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 10:26:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:56,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 10:26:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:56,660 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:26:56,660 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:26:56,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:26:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:26:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:26:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:26:56,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-06-22 10:26:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:56,661 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:26:56,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:26:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:26:56,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:26:56,943 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 21) no Hoare annotation was computed. [2020-06-22 10:26:56,944 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 21) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))) (.cse1 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse2 (<= .cse7 .cse1)) (.cse3 (<= 4 .cse7)) (.cse4 (= .cse1 (* 4 ULTIMATE.start_main_~length~0))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse6 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (let ((.cse0 (* 4 ULTIMATE.start_main_~j~0))) (and (<= (+ ULTIMATE.start_main_~arr~0.offset .cse0 4) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 4 (+ ULTIMATE.start_main_~arr~0.offset .cse0)))) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~j~0 0))))) [2020-06-22 10:26:56,944 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:26:56,944 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:26:56,944 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 17) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (= .cse4 (* 4 ULTIMATE.start_main_~length~0))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse2 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (and (<= 1 ULTIMATE.start_main_~length~0) .cse0 .cse1 (= ULTIMATE.start_main_~i~0 0) .cse2) (let ((.cse3 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0)))) (and (<= .cse3 .cse4) (<= 4 .cse3) .cse0 .cse1 .cse2))))) [2020-06-22 10:26:56,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:26:56,944 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,945 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:26:56,945 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse6 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))) (.cse5 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (<= .cse6 .cse5)) (.cse1 (<= 4 .cse6)) (.cse2 (= .cse5 (* 4 ULTIMATE.start_main_~length~0))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse4 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~j~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0))))))) [2020-06-22 10:26:56,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:26:56,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 10:26:56,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:26:56,947 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:26:56,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:56,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:26:56 BasicIcfg [2020-06-22 10:26:56,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:26:56,976 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:26:56,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:26:56,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:26:56,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:26:56,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:26:54" (1/5) ... [2020-06-22 10:26:56,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23fdc8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:26:56, skipping insertion in model container [2020-06-22 10:26:56,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:26:56,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:54" (2/5) ... [2020-06-22 10:26:56,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23fdc8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:26:56, skipping insertion in model container [2020-06-22 10:26:56,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:26:56,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:55" (3/5) ... [2020-06-22 10:26:56,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23fdc8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:26:56, skipping insertion in model container [2020-06-22 10:26:56,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:26:56,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:55" (4/5) ... [2020-06-22 10:26:56,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23fdc8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:26:56, skipping insertion in model container [2020-06-22 10:26:56,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:26:56,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:26:56" (5/5) ... [2020-06-22 10:26:56,985 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:26:57,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:26:57,007 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:26:57,007 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:26:57,007 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:26:57,008 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:26:57,008 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:26:57,008 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:26:57,008 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:26:57,008 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:26:57,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 10:26:57,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:57,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:57,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:57,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:57,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:57,021 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:26:57,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 10:26:57,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:57,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:57,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:57,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:57,023 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:57,028 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 11#L8true [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 6#L8-2true [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 17#L10true [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.offset_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13#L11-2true [2020-06-22 10:26:57,029 INFO L796 eck$LassoCheckResult]: Loop: 13#L11-2true [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 22#L13true [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 20#L13-2true [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 13#L11-2true [2020-06-22 10:26:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 5558776, now seen corresponding path program 1 times [2020-06-22 10:26:57,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:57,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:57,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:57,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:26:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 1 times [2020-06-22 10:26:57,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:57,120 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-06-22 10:26:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:57,168 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-06-22 10:26:57,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:57,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2020-06-22 10:26:57,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:57,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 12 states and 18 transitions. [2020-06-22 10:26:57,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 10:26:57,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 10:26:57,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2020-06-22 10:26:57,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:57,175 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 10:26:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2020-06-22 10:26:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 10:26:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:26:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-06-22 10:26:57,177 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 10:26:57,177 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 10:26:57,178 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:26:57,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2020-06-22 10:26:57,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:57,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:57,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:57,179 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:57,179 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:57,179 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 55#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 57#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 51#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 52#L11-2 [2020-06-22 10:26:57,180 INFO L796 eck$LassoCheckResult]: Loop: 52#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 60#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 56#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 52#L11-2 [2020-06-22 10:26:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 5558774, now seen corresponding path program 1 times [2020-06-22 10:26:57,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:57,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:57,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:57,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:57,195 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:26:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 2 times [2020-06-22 10:26:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:57,264 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-06-22 10:26:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:57,330 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-06-22 10:26:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:57,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2020-06-22 10:26:57,332 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-06-22 10:26:57,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 30 transitions. [2020-06-22 10:26:57,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:26:57,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:26:57,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-06-22 10:26:57,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:57,334 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:26:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-06-22 10:26:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2020-06-22 10:26:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:26:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-06-22 10:26:57,336 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:26:57,336 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:26:57,336 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:26:57,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-06-22 10:26:57,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:57,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:57,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:57,337 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:57,337 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:57,338 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 93#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 96#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 97#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 91#L11-2 [2020-06-22 10:26:57,338 INFO L796 eck$LassoCheckResult]: Loop: 91#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 100#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 95#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 91#L11-2 [2020-06-22 10:26:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 5558743, now seen corresponding path program 1 times [2020-06-22 10:26:57,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 3 times [2020-06-22 10:26:57,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1903121683, now seen corresponding path program 1 times [2020-06-22 10:26:57,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,521 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:26:57,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:26:57,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:26:57,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:26:57,523 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:26:57,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:26:57,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:26:57,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:26:57,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:26:57,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:26:57,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:26:57,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:57,841 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:26:57,846 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:26:57,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:57,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:57,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:57,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:57,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:57,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:57,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:57,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:57,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:57,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:57,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:57,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:57,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:57,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:57,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:57,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:57,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:57,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:57,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:57,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:57,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:57,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:57,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:57,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:57,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:26:57,929 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:26:57,929 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:26:57,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:26:57,933 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:26:57,934 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:26:57,934 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2020-06-22 10:26:57,949 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:26:57,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:26:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:57,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:26:57,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:58,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:26:58,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:58,004 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 10:26:58,007 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 10:26:58,008 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-06-22 10:26:58,045 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 45 transitions. Complement of second has 4 states. [2020-06-22 10:26:58,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:26:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:26:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-06-22 10:26:58,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 10:26:58,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 10:26:58,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 10:26:58,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:58,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2020-06-22 10:26:58,056 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-06-22 10:26:58,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 33 transitions. [2020-06-22 10:26:58,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:26:58,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 10:26:58,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2020-06-22 10:26:58,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:58,057 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-06-22 10:26:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2020-06-22 10:26:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2020-06-22 10:26:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:26:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-06-22 10:26:58,059 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 10:26:58,059 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 10:26:58,059 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:26:58,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-06-22 10:26:58,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:58,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:58,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:58,060 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:58,060 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:58,061 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 189#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 193#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 194#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 186#L11-2 [2020-06-22 10:26:58,061 INFO L796 eck$LassoCheckResult]: Loop: 186#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 197#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 190#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 186#L11-2 [2020-06-22 10:26:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 5558742, now seen corresponding path program 1 times [2020-06-22 10:26:58,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:58,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:58,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:58,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:58,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:58,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:58,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:26:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 4 times [2020-06-22 10:26:58,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:58,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:58,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:58,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:58,132 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 10:26:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:58,152 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-06-22 10:26:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:58,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2020-06-22 10:26:58,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-06-22 10:26:58,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2020-06-22 10:26:58,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:26:58,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:26:58,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-06-22 10:26:58,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:58,157 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 10:26:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-06-22 10:26:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-06-22 10:26:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:26:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-06-22 10:26:58,159 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-06-22 10:26:58,159 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-06-22 10:26:58,159 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:26:58,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-06-22 10:26:58,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:58,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:58,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:58,160 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:58,160 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:58,161 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 233#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 239#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 240#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 236#L11-2 [2020-06-22 10:26:58,161 INFO L796 eck$LassoCheckResult]: Loop: 236#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 243#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 235#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 236#L11-2 [2020-06-22 10:26:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 5558773, now seen corresponding path program 1 times [2020-06-22 10:26:58,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:58,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 5 times [2020-06-22 10:26:58,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1902227953, now seen corresponding path program 1 times [2020-06-22 10:26:58,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:58,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:58,330 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:26:58,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:26:58,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:26:58,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:26:58,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:26:58,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:26:58,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:26:58,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:26:58,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:26:58,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:26:58,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:26:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:58,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:26:58,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:26:58,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:58,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:58,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:58,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:58,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:58,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:58,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:58,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:58,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:58,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:58,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:58,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:26:58,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:26:58,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:26:58,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:58,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:58,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:58,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:26:58,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:58,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:58,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:58,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:58,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:58,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:58,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:58,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:26:58,644 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:26:58,644 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:26:58,645 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:26:58,646 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 10:26:58,646 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:26:58,646 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 4 >= 0] [2020-06-22 10:26:58,657 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:26:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:58,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:26:58,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:58,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-06-22 10:26:58,762 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:58,770 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:58,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:58,771 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2020-06-22 10:26:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:58,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:26:58,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:58,860 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:26:58,861 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-06-22 10:26:58,861 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-06-22 10:26:59,042 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 25 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 62 states and 92 transitions. Complement of second has 9 states. [2020-06-22 10:26:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 10:26:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:26:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-06-22 10:26:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 10:26:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 10:26:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 10:26:59,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 92 transitions. [2020-06-22 10:26:59,048 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2020-06-22 10:26:59,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 47 states and 67 transitions. [2020-06-22 10:26:59,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 10:26:59,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-06-22 10:26:59,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 67 transitions. [2020-06-22 10:26:59,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:59,050 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 67 transitions. [2020-06-22 10:26:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 67 transitions. [2020-06-22 10:26:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 19. [2020-06-22 10:26:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:26:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2020-06-22 10:26:59,052 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-06-22 10:26:59,052 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-06-22 10:26:59,052 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:26:59,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2020-06-22 10:26:59,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:26:59,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:59,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:59,054 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:26:59,054 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:59,054 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 391#L8 [115] L8-->L8-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 402#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 403#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 393#L11-2 [2020-06-22 10:26:59,054 INFO L796 eck$LassoCheckResult]: Loop: 393#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 400#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 392#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 393#L11-2 [2020-06-22 10:26:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 5566461, now seen corresponding path program 1 times [2020-06-22 10:26:59,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 6 times [2020-06-22 10:26:59,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1673194745, now seen corresponding path program 1 times [2020-06-22 10:26:59,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,223 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:26:59,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:26:59,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:26:59,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:26:59,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:26:59,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:26:59,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:26:59,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:26:59,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:26:59,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:26:59,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:26:59,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:26:59,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:26:59,571 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:26:59,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:26:59,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:26:59,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:26:59,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:26:59,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:26:59,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:26:59,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:26:59,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:26:59,606 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:26:59,606 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:26:59,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:26:59,608 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:26:59,608 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:26:59,608 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-06-22 10:26:59,622 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:26:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:59,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:26:59,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:59,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:26:59,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:59,684 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:26:59,685 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:26:59,685 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 10:26:59,720 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 62 transitions. Complement of second has 6 states. [2020-06-22 10:26:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:26:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:26:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-06-22 10:26:59,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 10:26:59,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 10:26:59,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 10:26:59,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:26:59,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 62 transitions. [2020-06-22 10:26:59,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 10:26:59,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 44 transitions. [2020-06-22 10:26:59,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 10:26:59,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:26:59,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2020-06-22 10:26:59,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:59,729 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-06-22 10:26:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2020-06-22 10:26:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 14. [2020-06-22 10:26:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:26:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-06-22 10:26:59,730 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 10:26:59,730 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 10:26:59,731 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:26:59,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-06-22 10:26:59,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:26:59,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:59,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:59,732 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:26:59,732 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:59,732 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 505#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 509#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 502#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 503#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 500#L18-3 [2020-06-22 10:26:59,732 INFO L796 eck$LassoCheckResult]: Loop: 500#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 501#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 506#L19-1 [157] L19-1-->L18-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_19 1) v_ULTIMATE.start_main_~j~0_18) (<= |v_ULTIMATE.start_main_#t~mem5_9| 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 500#L18-3 [2020-06-22 10:26:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 172321187, now seen corresponding path program 1 times [2020-06-22 10:26:59,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:59,752 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:26:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 1 times [2020-06-22 10:26:59,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:59,791 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-06-22 10:26:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:59,818 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-06-22 10:26:59,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:59,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-06-22 10:26:59,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:26:59,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 10:26:59,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:26:59,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:26:59,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-06-22 10:26:59,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:26:59,822 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 10:26:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-06-22 10:26:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-06-22 10:26:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:26:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 10:26:59,824 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:26:59,824 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:26:59,824 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:26:59,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-22 10:26:59,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:26:59,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:26:59,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:26:59,825 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:59,825 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:26:59,826 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 542#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 546#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 539#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 540#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 550#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 544#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 545#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 537#L18-3 [2020-06-22 10:26:59,826 INFO L796 eck$LassoCheckResult]: Loop: 537#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 538#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 543#L19-1 [157] L19-1-->L18-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_19 1) v_ULTIMATE.start_main_~j~0_18) (<= |v_ULTIMATE.start_main_#t~mem5_9| 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 537#L18-3 [2020-06-22 10:26:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1132775891, now seen corresponding path program 1 times [2020-06-22 10:26:59,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 2 times [2020-06-22 10:26:59,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash 968603316, now seen corresponding path program 1 times [2020-06-22 10:26:59,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:59,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,014 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-06-22 10:27:00,064 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:27:00,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:27:00,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:27:00,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:27:00,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:27:00,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:27:00,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:27:00,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:27:00,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:27:00,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:27:00,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:27:00,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:27:00,384 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:27:00,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:00,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:00,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:00,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:00,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:00,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:00,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:00,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:00,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:00,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:00,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:00,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:00,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:00,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:00,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:00,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:00,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:00,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:00,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:00,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:00,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:00,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:00,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:00,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:00,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:00,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:27:00,424 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:27:00,425 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:27:00,425 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:27:00,426 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:27:00,426 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:27:00,427 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-06-22 10:27:00,433 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:27:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:00,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:27:00,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:00,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:27:00,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:27:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:00,526 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:27:00,526 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:27:00,526 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 10:27:00,551 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 27 transitions. Complement of second has 4 states. [2020-06-22 10:27:00,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:27:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:27:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2020-06-22 10:27:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. [2020-06-22 10:27:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. [2020-06-22 10:27:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-22 10:27:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:00,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2020-06-22 10:27:00,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:27:00,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2020-06-22 10:27:00,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:27:00,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 10:27:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-06-22 10:27:00,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:27:00,558 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 10:27:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-06-22 10:27:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 10:27:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:27:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-06-22 10:27:00,559 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 10:27:00,559 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 10:27:00,560 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:27:00,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-06-22 10:27:00,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:27:00,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:00,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:00,561 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:00,561 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:27:00,561 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 654#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 657#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 649#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 650#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 663#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 655#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 656#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 645#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 647#L19-3 [2020-06-22 10:27:00,562 INFO L796 eck$LassoCheckResult]: Loop: 647#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 651#L19-1 [106] L19-1-->L20: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 661#L20 [158] L20-->L20-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_20))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_15))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) .cse0) |v_ULTIMATE.start_main_#t~mem6_6|) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)) (<= 0 .cse0) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 659#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_21))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_16))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) .cse0 (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 647#L19-3 [2020-06-22 10:27:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 756314332, now seen corresponding path program 1 times [2020-06-22 10:27:00,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 1 times [2020-06-22 10:27:00,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1180160510, now seen corresponding path program 1 times [2020-06-22 10:27:00,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:00,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:00,733 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 10:27:00,770 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:27:00,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:27:00,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:27:00,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:27:00,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:27:00,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:27:00,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:27:00,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:27:00,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 10:27:00,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:27:00,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:27:00,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:00,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:01,112 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:27:01,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:27:01,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:01,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:01,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:01,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:01,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:01,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:01,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:01,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:01,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:01,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:01,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:01,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:27:01,201 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:27:01,201 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:27:01,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:27:01,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:27:01,203 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:27:01,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2 Supporting invariants [] [2020-06-22 10:27:01,211 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:27:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:27:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:01,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:27:01,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:27:01,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:01,371 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:27:01,371 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:27:01,372 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 10:27:01,372 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 10:27:01,415 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 26 states and 34 transitions. Complement of second has 8 states. [2020-06-22 10:27:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 10:27:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:27:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-06-22 10:27:01,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 10:27:01,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:01,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 10:27:01,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:01,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 10:27:01,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:01,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-06-22 10:27:01,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:27:01,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-06-22 10:27:01,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:27:01,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:27:01,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:27:01,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:27:01,420 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:01,420 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:01,420 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:01,421 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 10:27:01,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:27:01,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:27:01,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:27:01,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:27:01 BasicIcfg [2020-06-22 10:27:01,427 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:27:01,427 INFO L168 Benchmark]: Toolchain (without parser) took 6921.78 ms. Allocated memory was 649.6 MB in the beginning and 870.3 MB in the end (delta: 220.7 MB). Free memory was 558.5 MB in the beginning and 785.0 MB in the end (delta: -226.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:27:01,428 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:27:01,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.89 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 613.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 649.6 MB. Free memory was 613.5 MB in the beginning and 611.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,430 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 649.6 MB. Free memory was 611.3 MB in the beginning and 610.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,430 INFO L168 Benchmark]: RCFGBuilder took 292.62 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 589.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,431 INFO L168 Benchmark]: BlockEncodingV2 took 113.40 ms. Allocated memory is still 649.6 MB. Free memory was 589.2 MB in the beginning and 580.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,432 INFO L168 Benchmark]: TraceAbstraction took 1702.88 ms. Allocated memory is still 649.6 MB. Free memory was 579.5 MB in the beginning and 389.7 MB in the end (delta: 189.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:01,432 INFO L168 Benchmark]: BuchiAutomizer took 4450.64 ms. Allocated memory was 649.6 MB in the beginning and 870.3 MB in the end (delta: 220.7 MB). Free memory was 388.6 MB in the beginning and 785.0 MB in the end (delta: -396.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:27:01,436 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 38 edges - StatisticsResult: Encoded RCFG 20 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 293.89 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 613.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 649.6 MB. Free memory was 613.5 MB in the beginning and 611.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.24 ms. Allocated memory is still 649.6 MB. Free memory was 611.3 MB in the beginning and 610.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 292.62 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 589.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 113.40 ms. Allocated memory is still 649.6 MB. Free memory was 589.2 MB in the beginning and 580.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1702.88 ms. Allocated memory is still 649.6 MB. Free memory was 579.5 MB in the beginning and 389.7 MB in the end (delta: 189.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4450.64 ms. Allocated memory was 649.6 MB in the beginning and 870.3 MB in the end (delta: 220.7 MB). Free memory was 388.6 MB in the beginning and 785.0 MB in the end (delta: -396.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-06-22 10:27:01,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && j == 0) || (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && 4 <= arr + 4 * j) - InvariantResult [Line: 19]: Loop Invariant [2020-06-22 10:27:01,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((arr + 4 * j + 4 <= unknown-#length-unknown[arr] && arr + 4 * i <= unknown-#length-unknown[arr]) && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && 4 <= arr + 4 * j) || (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && j == 0) - InvariantResult [Line: 11]: Loop Invariant [2020-06-22 10:27:01,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:01,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= length && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && i == 0) && arr == 0) || ((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 8 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 224 SDslu, 67 SDs, 0 SdLazy, 316 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 10 NumberOfFragments, 215 HoareAnnotationTreeSize, 3 FomulaSimplifications, 149 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 1932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * arr + 1 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + length and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + length and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 66 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 245 SDslu, 80 SDs, 0 SdLazy, 249 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp93 ukn83 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf88 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:27:01.675 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check