./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:05,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:05,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:05,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:05,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:05,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:05,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:05,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:05,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:05,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:05,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:05,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:05,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:05,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:05,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:05,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:05,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:05,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:05,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:05,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:05,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:05,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:05,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:05,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:05,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:05,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:05,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:05,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:05,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:05,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:05,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:05,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:05,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:05,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:05,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:05,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:05,349 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:05,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:05,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:05,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:05,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:05,362 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:05,363 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:05,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:05,363 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:05,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:05,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:05,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:05,365 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:05,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:05,367 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:05,367 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:05,368 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:05,368 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2018-10-27 06:07:05,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:05,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:05,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:05,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:05,418 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:05,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-10-27 06:07:05,481 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/data/7ac8ed23b/d690729e67db4ca5a3cd6d9438c09bab/FLAG8903ab8c5 [2018-10-27 06:07:05,906 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:05,907 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-10-27 06:07:05,918 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/data/7ac8ed23b/d690729e67db4ca5a3cd6d9438c09bab/FLAG8903ab8c5 [2018-10-27 06:07:05,931 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/data/7ac8ed23b/d690729e67db4ca5a3cd6d9438c09bab [2018-10-27 06:07:05,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:05,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:05,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:05,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:05,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:05,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4be8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05, skipping insertion in model container [2018-10-27 06:07:05,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:06,001 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:06,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:06,303 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:06,367 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:06,408 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:06,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06 WrapperNode [2018-10-27 06:07:06,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:06,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:06,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:06,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:06,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:06,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:06,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:06,519 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:06,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:06,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:06,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:06,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:06,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b570a34d-b1d0-4a38-9744-a8541037b08b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:06,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:06,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:06,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:06,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:07,435 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:07,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07 BoogieIcfgContainer [2018-10-27 06:07:07,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:07,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:07,437 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:07,439 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:07,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:05" (1/3) ... [2018-10-27 06:07:07,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c1e5c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:07, skipping insertion in model container [2018-10-27 06:07:07,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06" (2/3) ... [2018-10-27 06:07:07,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c1e5c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:07, skipping insertion in model container [2018-10-27 06:07:07,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07" (3/3) ... [2018-10-27 06:07:07,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-10-27 06:07:07,495 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:07,495 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:07,495 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:07,495 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:07,495 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:07,496 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:07,496 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:07,496 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:07,496 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:07,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states. [2018-10-27 06:07:07,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:07,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:07,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:07,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,542 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:07,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states. [2018-10-27 06:07:07,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:07,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:07,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:07,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,557 INFO L793 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 74#L553true assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 43#L554true SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 68#L556-1true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 94#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 86#L561true SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 88#L561-1true main_#t~post12 := main_#t~mem11; 91#L561-2true SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 82#L561-3true havoc main_#t~mem11;havoc main_#t~post12; 99#L558-2true SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 13#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5#L566true SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 7#L566-1true main_#t~post17 := main_#t~mem16; 102#L566-2true SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 104#L566-3true havoc main_#t~mem16;havoc main_#t~post17; 18#L563-2true SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 28#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 24#L571true SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 25#L571-1true main_#t~post22 := main_#t~mem21; 21#L571-2true SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 22#L571-3true havoc main_#t~post22;havoc main_#t~mem21; 32#L568-2true SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 46#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 41#L576true SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 44#L576-1true main_#t~post27 := main_#t~mem26; 35#L576-2true SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 37#L576-3true havoc main_#t~mem26;havoc main_#t~post27; 49#L573-2true SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 63#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 59#L581true SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 51#L581-1true main_#t~post32 := main_#t~mem31; 53#L581-2true SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 55#L581-3true havoc main_#t~post32;havoc main_#t~mem31; 70#L578-2true SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 85#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33; 45#L584true SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 47#L584-1true main_#t~post35 := main_#t~mem34; 48#L584-2true SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 50#L584-3true havoc main_#t~post35;havoc main_#t~mem34; 90#L583-2true SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4#L588true assume main_#t~mem38 > 0;havoc main_#t~mem38; 62#L589true SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 66#L589-1true main_#t~post40 := main_#t~mem39; 69#L589-2true SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 72#L589-3true havoc main_#t~mem39;havoc main_#t~post40; 9#L588-2true SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 23#L593true assume main_#t~mem43 > 0;havoc main_#t~mem43; 84#L594true SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 87#L594-1true main_#t~post45 := main_#t~mem44; 89#L594-2true SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 92#L594-3true havoc main_#t~post45;havoc main_#t~mem44; 26#L598-8true [2018-10-27 06:07:07,558 INFO L795 eck$LassoCheckResult]: Loop: 26#L598-8true assume true; 40#L598true SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 42#L598-1true main_#t~short50 := main_#t~mem48 < 100; 34#L598-2true assume !main_#t~short50; 39#L598-6true assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 3#L599true SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 6#L599-1true SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 8#L599-2true SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 103#L599-3true havoc main_#t~mem52;havoc main_#t~mem51; 61#L600true SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 64#L600-1true SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 67#L600-2true SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 71#L600-3true havoc main_#t~mem54;havoc main_#t~mem53; 26#L598-8true [2018-10-27 06:07:07,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1648486038, now seen corresponding path program 1 times [2018-10-27 06:07:07,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:07,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:07:07,762 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:07,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash -758487761, now seen corresponding path program 1 times [2018-10-27 06:07:07,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:07,804 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:07,818 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-10-27 06:07:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:07,915 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-10-27 06:07:07,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:07,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 115 transitions. [2018-10-27 06:07:07,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:07,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 100 states and 109 transitions. [2018-10-27 06:07:07,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-10-27 06:07:07,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2018-10-27 06:07:07,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 109 transitions. [2018-10-27 06:07:07,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:07,928 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-10-27 06:07:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 109 transitions. [2018-10-27 06:07:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-27 06:07:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 06:07:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-10-27 06:07:07,961 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-10-27 06:07:07,962 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-10-27 06:07:07,962 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:07,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 109 transitions. [2018-10-27 06:07:07,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:07,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:07,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:07,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,965 INFO L793 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 233#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 271#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 272#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 295#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 308#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 309#L561-1 main_#t~post12 := main_#t~mem11; 311#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 305#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 285#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 238#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 225#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 226#L566-1 main_#t~post17 := main_#t~mem16; 228#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 319#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 244#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 245#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 252#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 253#L571-1 main_#t~post22 := main_#t~mem21; 248#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 249#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 250#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 260#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 269#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 270#L576-1 main_#t~post27 := main_#t~mem26; 264#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 265#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 247#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 277#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 286#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 279#L581-1 main_#t~post32 := main_#t~mem31; 280#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 283#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 261#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 297#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 273#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 274#L584-1 main_#t~post35 := main_#t~mem34; 275#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 276#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 278#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 222#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 223#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 290#L589-1 main_#t~post40 := main_#t~mem39; 293#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 296#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 230#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 231#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 251#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 307#L594-1 main_#t~post45 := main_#t~mem44; 310#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 312#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 246#L598-8 [2018-10-27 06:07:07,965 INFO L795 eck$LassoCheckResult]: Loop: 246#L598-8 assume true; 254#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 268#L598-1 main_#t~short50 := main_#t~mem48 < 100; 262#L598-2 assume main_#t~short50; 263#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 266#L598-4 main_#t~short50 := main_#t~mem49 < 100; 267#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 220#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 221#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 227#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 229#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 288#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 289#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 291#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 294#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 246#L598-8 [2018-10-27 06:07:07,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1648486038, now seen corresponding path program 2 times [2018-10-27 06:07:07,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:07:08,050 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:08,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 1 times [2018-10-27 06:07:08,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,447 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:08,784 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 06:07:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:07:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:07:08,785 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-10-27 06:07:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:09,160 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-10-27 06:07:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:09,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 114 transitions. [2018-10-27 06:07:09,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:09,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 114 transitions. [2018-10-27 06:07:09,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-10-27 06:07:09,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-10-27 06:07:09,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 114 transitions. [2018-10-27 06:07:09,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:09,172 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-10-27 06:07:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 114 transitions. [2018-10-27 06:07:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-27 06:07:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-27 06:07:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-10-27 06:07:09,181 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-10-27 06:07:09,181 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-10-27 06:07:09,181 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:09,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 111 transitions. [2018-10-27 06:07:09,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:09,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:09,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:09,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,187 INFO L793 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 447#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 485#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 486#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 510#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 501#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 495#L559-1 main_#t~post10 := main_#t~mem9; 496#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 498#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 499#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 452#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 439#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 440#L566-1 main_#t~post17 := main_#t~mem16; 442#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 534#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 458#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 459#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 466#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 467#L571-1 main_#t~post22 := main_#t~mem21; 462#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 463#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 464#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 474#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 483#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 484#L576-1 main_#t~post27 := main_#t~mem26; 478#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 479#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 461#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 491#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 500#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 493#L581-1 main_#t~post32 := main_#t~mem31; 494#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 497#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 475#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 512#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 487#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 488#L584-1 main_#t~post35 := main_#t~mem34; 489#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 490#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 492#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 436#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 437#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 504#L589-1 main_#t~post40 := main_#t~mem39; 508#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 511#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 444#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 445#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 465#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 522#L594-1 main_#t~post45 := main_#t~mem44; 525#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 527#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 460#L598-8 [2018-10-27 06:07:09,187 INFO L795 eck$LassoCheckResult]: Loop: 460#L598-8 assume true; 468#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 482#L598-1 main_#t~short50 := main_#t~mem48 < 100; 476#L598-2 assume main_#t~short50; 477#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 480#L598-4 main_#t~short50 := main_#t~mem49 < 100; 481#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 434#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 435#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 441#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 443#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 502#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 503#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 505#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 509#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 460#L598-8 [2018-10-27 06:07:09,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -214154652, now seen corresponding path program 1 times [2018-10-27 06:07:09,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:09,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:09,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 06:07:09,370 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:09,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 2 times [2018-10-27 06:07:09,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,597 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:07:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:07:09,656 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:07:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:09,847 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-10-27 06:07:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:07:09,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 120 transitions. [2018-10-27 06:07:09,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:09,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 120 transitions. [2018-10-27 06:07:09,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-10-27 06:07:09,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-10-27 06:07:09,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 120 transitions. [2018-10-27 06:07:09,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:09,852 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-10-27 06:07:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 120 transitions. [2018-10-27 06:07:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-10-27 06:07:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 06:07:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-10-27 06:07:09,857 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-10-27 06:07:09,858 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-10-27 06:07:09,858 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:09,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 117 transitions. [2018-10-27 06:07:09,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:09,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:09,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:09,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,861 INFO L793 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 677#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 678#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 716#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 717#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 741#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 760#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 772#L559-1 main_#t~post10 := main_#t~mem9; 771#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 770#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 766#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 683#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 684#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 744#L564-1 main_#t~post15 := main_#t~mem14; 748#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 750#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 689#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 690#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 697#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 698#L571-1 main_#t~post22 := main_#t~mem21; 693#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 694#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 695#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 705#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 714#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 715#L576-1 main_#t~post27 := main_#t~mem26; 709#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 710#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 692#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 722#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 731#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 724#L581-1 main_#t~post32 := main_#t~mem31; 725#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 728#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 706#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 743#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 718#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 719#L584-1 main_#t~post35 := main_#t~mem34; 720#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 721#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 723#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 667#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 668#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 735#L589-1 main_#t~post40 := main_#t~mem39; 739#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 742#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 675#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 676#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 696#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 753#L594-1 main_#t~post45 := main_#t~mem44; 756#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 758#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 691#L598-8 [2018-10-27 06:07:09,861 INFO L795 eck$LassoCheckResult]: Loop: 691#L598-8 assume true; 699#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 713#L598-1 main_#t~short50 := main_#t~mem48 < 100; 707#L598-2 assume main_#t~short50; 708#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 711#L598-4 main_#t~short50 := main_#t~mem49 < 100; 712#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 665#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 666#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 672#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 674#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 733#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 734#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 736#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 740#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 691#L598-8 [2018-10-27 06:07:09,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,861 INFO L82 PathProgramCache]: Analyzing trace with hash 685977310, now seen corresponding path program 1 times [2018-10-27 06:07:09,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:10,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:10,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-27 06:07:10,042 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:10,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 3 times [2018-10-27 06:07:10,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,226 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:07:10,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:07:10,274 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-10-27 06:07:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:10,605 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-10-27 06:07:10,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:07:10,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 126 transitions. [2018-10-27 06:07:10,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:10,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 126 transitions. [2018-10-27 06:07:10,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-10-27 06:07:10,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-10-27 06:07:10,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 126 transitions. [2018-10-27 06:07:10,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:10,609 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-10-27 06:07:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 126 transitions. [2018-10-27 06:07:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-10-27 06:07:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-27 06:07:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-10-27 06:07:10,615 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-10-27 06:07:10,615 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-10-27 06:07:10,615 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:10,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 123 transitions. [2018-10-27 06:07:10,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:10,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:10,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:10,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,618 INFO L793 eck$LassoCheckResult]: Stem: 1000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 931#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 969#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 970#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 994#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 985#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 979#L559-1 main_#t~post10 := main_#t~mem9; 980#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 982#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 983#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 936#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 937#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 997#L564-1 main_#t~post15 := main_#t~mem14; 1001#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1003#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 942#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 943#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 955#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1013#L569-1 main_#t~post20 := main_#t~mem19; 1016#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1018#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 948#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 958#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 967#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 968#L576-1 main_#t~post27 := main_#t~mem26; 962#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 963#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 945#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 975#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 984#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 977#L581-1 main_#t~post32 := main_#t~mem31; 978#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 981#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 959#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 996#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 971#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 972#L584-1 main_#t~post35 := main_#t~mem34; 973#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 974#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 976#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 920#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 921#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 988#L589-1 main_#t~post40 := main_#t~mem39; 992#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 995#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 928#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 929#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 949#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1007#L594-1 main_#t~post45 := main_#t~mem44; 1010#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1012#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 944#L598-8 [2018-10-27 06:07:10,618 INFO L795 eck$LassoCheckResult]: Loop: 944#L598-8 assume true; 952#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 966#L598-1 main_#t~short50 := main_#t~mem48 < 100; 960#L598-2 assume main_#t~short50; 961#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 964#L598-4 main_#t~short50 := main_#t~mem49 < 100; 965#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 918#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 919#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 925#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 927#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 986#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 987#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 989#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 993#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 944#L598-8 [2018-10-27 06:07:10,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1351909672, now seen corresponding path program 1 times [2018-10-27 06:07:10,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:10,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:10,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:10,737 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:10,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 4 times [2018-10-27 06:07:10,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,966 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:11,057 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-10-27 06:07:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:11,175 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-10-27 06:07:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:11,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 128 transitions. [2018-10-27 06:07:11,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:11,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 128 transitions. [2018-10-27 06:07:11,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-10-27 06:07:11,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2018-10-27 06:07:11,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 128 transitions. [2018-10-27 06:07:11,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:11,179 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-10-27 06:07:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 128 transitions. [2018-10-27 06:07:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-27 06:07:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-27 06:07:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-10-27 06:07:11,183 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-27 06:07:11,184 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-27 06:07:11,184 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:11,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 125 transitions. [2018-10-27 06:07:11,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:11,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:11,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:11,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,186 INFO L793 eck$LassoCheckResult]: Stem: 1253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1183#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 1222#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1223#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1247#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 1238#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1232#L559-1 main_#t~post10 := main_#t~mem9; 1233#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 1235#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 1236#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 1188#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 1189#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 1250#L564-1 main_#t~post15 := main_#t~mem14; 1254#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1256#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 1194#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 1195#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 1207#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1266#L569-1 main_#t~post20 := main_#t~mem19; 1269#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1271#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 1210#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 1211#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 1186#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 1187#L574-1 main_#t~post25 := main_#t~mem24; 1191#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 1193#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 1197#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 1228#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 1237#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 1230#L581-1 main_#t~post32 := main_#t~mem31; 1231#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 1234#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 1212#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 1249#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 1224#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 1225#L584-1 main_#t~post35 := main_#t~mem34; 1226#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 1227#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 1229#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 1172#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 1173#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 1241#L589-1 main_#t~post40 := main_#t~mem39; 1245#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 1248#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 1180#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 1181#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 1201#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1260#L594-1 main_#t~post45 := main_#t~mem44; 1263#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1265#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 1196#L598-8 [2018-10-27 06:07:11,186 INFO L795 eck$LassoCheckResult]: Loop: 1196#L598-8 assume true; 1204#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 1219#L598-1 main_#t~short50 := main_#t~mem48 < 100; 1213#L598-2 assume main_#t~short50; 1214#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 1217#L598-4 main_#t~short50 := main_#t~mem49 < 100; 1218#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 1170#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 1171#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 1177#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 1179#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 1239#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 1240#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 1242#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 1246#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 1196#L598-8 [2018-10-27 06:07:11,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1769614766, now seen corresponding path program 1 times [2018-10-27 06:07:11,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:11,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:11,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:11,369 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:11,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 5 times [2018-10-27 06:07:11,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,645 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:11,743 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-10-27 06:07:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:11,888 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-10-27 06:07:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:11,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 130 transitions. [2018-10-27 06:07:11,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:11,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 130 transitions. [2018-10-27 06:07:11,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-10-27 06:07:11,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-10-27 06:07:11,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 130 transitions. [2018-10-27 06:07:11,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:11,892 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-10-27 06:07:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 130 transitions. [2018-10-27 06:07:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-10-27 06:07:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 06:07:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-10-27 06:07:11,895 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-10-27 06:07:11,895 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-10-27 06:07:11,895 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:11,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 127 transitions. [2018-10-27 06:07:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:11,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:11,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:11,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,897 INFO L793 eck$LassoCheckResult]: Stem: 1510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1439#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 1479#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1480#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1504#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 1495#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1489#L559-1 main_#t~post10 := main_#t~mem9; 1490#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 1492#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 1493#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 1444#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 1445#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 1507#L564-1 main_#t~post15 := main_#t~mem14; 1511#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1513#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 1450#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 1451#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 1463#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1523#L569-1 main_#t~post20 := main_#t~mem19; 1526#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1528#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 1466#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 1467#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 1442#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 1443#L574-1 main_#t~post25 := main_#t~mem24; 1447#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 1449#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 1453#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 1485#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 1461#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 1462#L579-1 main_#t~post30 := main_#t~mem29; 1464#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 1465#L579-3 havoc main_#t~post30;havoc main_#t~mem29; 1468#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 1506#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 1481#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 1482#L584-1 main_#t~post35 := main_#t~mem34; 1483#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 1484#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 1486#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 1428#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 1429#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 1498#L589-1 main_#t~post40 := main_#t~mem39; 1502#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 1505#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 1436#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 1437#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 1457#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1517#L594-1 main_#t~post45 := main_#t~mem44; 1520#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1522#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 1452#L598-8 [2018-10-27 06:07:11,898 INFO L795 eck$LassoCheckResult]: Loop: 1452#L598-8 assume true; 1460#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 1476#L598-1 main_#t~short50 := main_#t~mem48 < 100; 1469#L598-2 assume main_#t~short50; 1470#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 1473#L598-4 main_#t~short50 := main_#t~mem49 < 100; 1475#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 1426#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 1427#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 1433#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 1435#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 1496#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 1497#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 1499#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 1503#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 1452#L598-8 [2018-10-27 06:07:11,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 651872588, now seen corresponding path program 1 times [2018-10-27 06:07:11,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:11,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 6 times [2018-10-27 06:07:11,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1718114009, now seen corresponding path program 1 times [2018-10-27 06:07:11,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,220 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:16,733 WARN L179 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 219 DAG size of output: 205 [2018-10-27 06:07:16,848 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:07:16,861 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:16,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:16,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:16,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:16,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:16,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:16,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:16,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:16,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:07:16,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:16,864 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:16,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,519 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2018-10-27 06:07:17,638 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:07:17,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,348 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:18,353 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:18,354 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 [2018-10-27 06:07:18,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,363 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 [2018-10-27 06:07:18,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,365 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 [2018-10-27 06:07:18,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,367 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 [2018-10-27 06:07:18,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,368 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 [2018-10-27 06:07:18,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,370 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 [2018-10-27 06:07:18,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,373 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 [2018-10-27 06:07:18,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,374 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 [2018-10-27 06:07:18,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,376 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 [2018-10-27 06:07:18,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,381 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 [2018-10-27 06:07:18,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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 [2018-10-27 06:07:18,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,385 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 [2018-10-27 06:07:18,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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 [2018-10-27 06:07:18,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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 [2018-10-27 06:07:18,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,391 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 [2018-10-27 06:07:18,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,402 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 [2018-10-27 06:07:18,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,406 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 [2018-10-27 06:07:18,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,408 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 [2018-10-27 06:07:18,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,411 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 [2018-10-27 06:07:18,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,412 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 [2018-10-27 06:07:18,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,427 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 [2018-10-27 06:07:18,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,431 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 [2018-10-27 06:07:18,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,433 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 [2018-10-27 06:07:18,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,443 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 [2018-10-27 06:07:18,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,445 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 [2018-10-27 06:07:18,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,447 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 [2018-10-27 06:07:18,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,449 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 [2018-10-27 06:07:18,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,452 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 [2018-10-27 06:07:18,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,463 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 [2018-10-27 06:07:18,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,468 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 [2018-10-27 06:07:18,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,483 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 [2018-10-27 06:07:18,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,485 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 [2018-10-27 06:07:18,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,487 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 [2018-10-27 06:07:18,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,490 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 [2018-10-27 06:07:18,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,493 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 [2018-10-27 06:07:18,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,495 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 [2018-10-27 06:07:18,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,497 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 [2018-10-27 06:07:18,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,506 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 [2018-10-27 06:07:18,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,511 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 [2018-10-27 06:07:18,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,512 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 [2018-10-27 06:07:18,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,514 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 [2018-10-27 06:07:18,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,516 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 [2018-10-27 06:07:18,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,524 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 [2018-10-27 06:07:18,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,526 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 [2018-10-27 06:07:18,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,528 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 [2018-10-27 06:07:18,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,531 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 [2018-10-27 06:07:18,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,536 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 [2018-10-27 06:07:18,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,538 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 [2018-10-27 06:07:18,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,540 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 [2018-10-27 06:07:18,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,544 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 [2018-10-27 06:07:18,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,551 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 [2018-10-27 06:07:18,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,554 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 [2018-10-27 06:07:18,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,556 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 [2018-10-27 06:07:18,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,561 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 [2018-10-27 06:07:18,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,565 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 [2018-10-27 06:07:18,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,569 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 [2018-10-27 06:07:18,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,581 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 [2018-10-27 06:07:18,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,582 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:18,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,583 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:18,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,593 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 [2018-10-27 06:07:18,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,603 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 [2018-10-27 06:07:18,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,604 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:18,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,605 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:18,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,610 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 [2018-10-27 06:07:18,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:18,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:18,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:18,629 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:07:18,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:18,634 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:07:18,635 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:18,635 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 207 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 9 >= 0] [2018-10-27 06:07:19,670 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-10-27 06:07:19,683 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:19,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:19,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:19,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:19,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:07:19,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:19,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:19,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:07:19,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-10-27 06:07:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,809 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:20,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:20,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:20,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:20,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:20,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:21,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:21,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:21,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:07:21,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:21,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:21,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:21,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-27 06:07:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:21,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:21,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:21,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:07:21,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-27 06:07:21,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:21,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:21,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-10-27 06:07:21,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:07:21,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 06:07:21,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-10-27 06:07:21,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:252 [2018-10-27 06:07:22,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-10-27 06:07:22,249 INFO L477 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 12 treesize of output 11 [2018-10-27 06:07:22,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-10-27 06:07:22,382 INFO L477 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 12 treesize of output 11 [2018-10-27 06:07:22,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-10-27 06:07:22,509 INFO L477 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 12 treesize of output 11 [2018-10-27 06:07:22,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:22,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-27 06:07:22,741 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:173, output treesize:128 [2018-10-27 06:07:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:22,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.28 stem predicates 7 loop predicates [2018-10-27 06:07:22,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 127 transitions. cyclomatic complexity: 10 Second operand 36 states. [2018-10-27 06:07:25,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 127 transitions. cyclomatic complexity: 10. Second operand 36 states. Result 223 states and 238 transitions. Complement of second has 46 states. [2018-10-27 06:07:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 38 states 29 stem states 7 non-accepting loop states 2 accepting loop states [2018-10-27 06:07:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:07:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 189 transitions. [2018-10-27 06:07:25,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 52 letters. Loop has 15 letters. [2018-10-27 06:07:25,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:25,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 67 letters. Loop has 15 letters. [2018-10-27 06:07:25,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:25,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 52 letters. Loop has 30 letters. [2018-10-27 06:07:25,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:25,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 238 transitions. [2018-10-27 06:07:25,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-10-27 06:07:25,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 188 states and 201 transitions. [2018-10-27 06:07:25,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-10-27 06:07:25,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-10-27 06:07:25,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 201 transitions. [2018-10-27 06:07:25,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:25,288 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-10-27 06:07:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 201 transitions. [2018-10-27 06:07:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2018-10-27 06:07:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-27 06:07:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2018-10-27 06:07:25,306 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-10-27 06:07:25,306 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-10-27 06:07:25,306 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:07:25,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 169 transitions. [2018-10-27 06:07:25,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:25,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:25,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:25,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:25,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:25,309 INFO L793 eck$LassoCheckResult]: Stem: 2360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2291#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2329#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2330#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 2380#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 2345#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2339#L559-1 main_#t~post10 := main_#t~mem9; 2340#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 2342#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 2343#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2422#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2421#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 2420#L564-1 main_#t~post15 := main_#t~mem14; 2363#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 2364#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 2423#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2417#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2416#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 2415#L569-1 main_#t~post20 := main_#t~mem19; 2414#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 2413#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 2412#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2411#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 2410#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2409#L574-1 main_#t~post25 := main_#t~mem24; 2408#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2407#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2406#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 2405#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2404#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2403#L579-1 main_#t~post30 := main_#t~mem29; 2402#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2401#L579-3 havoc main_#t~post30;havoc main_#t~mem29; 2400#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 2399#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 2398#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 2397#L584-1 main_#t~post35 := main_#t~mem34; 2395#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 2394#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 2393#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 2392#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 2391#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 2390#L589-1 main_#t~post40 := main_#t~mem39; 2389#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 2388#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 2387#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2307#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43; 2288#L596 SUMMARY for call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L596 2289#L596-1 main_#t~post47 := main_#t~mem46; 2294#L596-2 SUMMARY for call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L596-2 2298#L596-3 havoc main_#t~post47;havoc main_#t~mem46; 2300#L598-8 [2018-10-27 06:07:25,310 INFO L795 eck$LassoCheckResult]: Loop: 2300#L598-8 assume true; 2310#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2326#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2319#L598-2 assume main_#t~short50; 2320#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2323#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2325#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 2276#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2277#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2281#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2284#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 2346#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 2347#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 2349#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 2353#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2300#L598-8 [2018-10-27 06:07:25,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash 657598418, now seen corresponding path program 1 times [2018-10-27 06:07:25,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:25,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:26,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:26,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:26,015 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:26,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 7 times [2018-10-27 06:07:26,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:26,209 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:26,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:26,246 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:07:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:26,416 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-10-27 06:07:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:26,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 173 transitions. [2018-10-27 06:07:26,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:26,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 155 states and 167 transitions. [2018-10-27 06:07:26,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-10-27 06:07:26,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-10-27 06:07:26,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 167 transitions. [2018-10-27 06:07:26,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:26,419 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 167 transitions. [2018-10-27 06:07:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 167 transitions. [2018-10-27 06:07:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-27 06:07:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-27 06:07:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-10-27 06:07:26,423 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-27 06:07:26,423 INFO L608 BuchiCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-27 06:07:26,423 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:07:26,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 164 transitions. [2018-10-27 06:07:26,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:26,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:26,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:26,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:26,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:26,434 INFO L793 eck$LassoCheckResult]: Stem: 2701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2626#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2667#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2668#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 2719#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 2720#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2733#L559-1 main_#t~post10 := main_#t~mem9; 2732#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 2731#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 2730#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2630#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2631#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 2739#L564-1 main_#t~post15 := main_#t~mem14; 2738#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 2737#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 2736#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2649#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2650#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 2716#L569-1 main_#t~post20 := main_#t~mem19; 2721#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 2723#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 2654#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2655#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 2627#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2628#L574-1 main_#t~post25 := main_#t~mem24; 2752#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2751#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2750#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 2688#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2647#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2648#L579-1 main_#t~post30 := main_#t~mem29; 2749#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2748#L579-3 havoc main_#t~post30;havoc main_#t~mem29; 2747#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 2710#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 2669#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 2670#L584-1 main_#t~post35 := main_#t~mem34; 2671#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 2672#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 2674#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 2614#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 2615#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 2717#L591-1 main_#t~post42 := main_#t~mem41; 2718#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 2722#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 2724#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2729#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 2643#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 2709#L594-1 main_#t~post45 := main_#t~mem44; 2711#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 2714#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 2636#L598-8 [2018-10-27 06:07:26,434 INFO L795 eck$LassoCheckResult]: Loop: 2636#L598-8 assume true; 2646#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2664#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2657#L598-2 assume main_#t~short50; 2658#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2661#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2663#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 2612#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2613#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2616#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2619#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 2684#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 2685#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 2689#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 2693#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2636#L598-8 [2018-10-27 06:07:26,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2076791982, now seen corresponding path program 1 times [2018-10-27 06:07:26,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:26,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:26,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:26,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:26,587 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:26,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 8 times [2018-10-27 06:07:26,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:26,816 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:26,850 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-10-27 06:07:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:26,963 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-10-27 06:07:26,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:26,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 168 transitions. [2018-10-27 06:07:26,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:26,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 151 states and 162 transitions. [2018-10-27 06:07:26,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-10-27 06:07:26,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-10-27 06:07:26,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 162 transitions. [2018-10-27 06:07:26,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:26,967 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 162 transitions. [2018-10-27 06:07:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 162 transitions. [2018-10-27 06:07:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-10-27 06:07:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 06:07:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-10-27 06:07:26,970 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-10-27 06:07:26,970 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-10-27 06:07:26,970 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:07:26,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 159 transitions. [2018-10-27 06:07:26,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:26,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:26,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:26,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:26,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:26,972 INFO L793 eck$LassoCheckResult]: Stem: 3028#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2954#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2994#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2995#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3063#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 3062#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 3061#L559-1 main_#t~post10 := main_#t~mem9; 3060#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 3059#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 3058#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2958#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2959#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 3070#L564-1 main_#t~post15 := main_#t~mem14; 3069#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 3067#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 3066#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2977#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2978#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 3044#L569-1 main_#t~post20 := main_#t~mem19; 3050#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 3051#L569-3 havoc main_#t~mem19;havoc main_#t~post20; 2981#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2982#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 3080#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2960#L574-1 main_#t~post25 := main_#t~mem24; 2961#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2963#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2967#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3001#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2975#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2976#L579-1 main_#t~post30 := main_#t~mem29; 2979#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2980#L579-3 havoc main_#t~post30;havoc main_#t~mem29; 2983#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3023#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 3037#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 3026#L586-1 main_#t~post37 := main_#t~mem36; 3027#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 3030#L586-3 havoc main_#t~post37;havoc main_#t~mem36; 3033#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3068#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 2943#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3015#L589-1 main_#t~post40 := main_#t~mem39; 3017#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3021#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 2949#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2950#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 2971#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3038#L594-1 main_#t~post45 := main_#t~mem44; 3039#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3042#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 2966#L598-8 [2018-10-27 06:07:26,972 INFO L795 eck$LassoCheckResult]: Loop: 2966#L598-8 assume true; 2974#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2991#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2984#L598-2 assume main_#t~short50; 2985#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2988#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2990#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 2940#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2941#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2944#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2947#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3013#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3014#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3016#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3020#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2966#L598-8 [2018-10-27 06:07:26,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1370132178, now seen corresponding path program 1 times [2018-10-27 06:07:26,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:26,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-27 06:07:27,387 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:27,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 9 times [2018-10-27 06:07:27,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:27,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:27,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:27,526 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 06:07:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-27 06:07:27,551 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. cyclomatic complexity: 12 Second operand 22 states. [2018-10-27 06:07:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:28,003 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-10-27 06:07:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 06:07:28,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 176 transitions. [2018-10-27 06:07:28,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:28,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 133 states and 143 transitions. [2018-10-27 06:07:28,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-10-27 06:07:28,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-10-27 06:07:28,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 143 transitions. [2018-10-27 06:07:28,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:28,007 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-10-27 06:07:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 143 transitions. [2018-10-27 06:07:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-27 06:07:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 06:07:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-10-27 06:07:28,014 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-10-27 06:07:28,014 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-10-27 06:07:28,014 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:07:28,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 143 transitions. [2018-10-27 06:07:28,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:28,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:28,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:28,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:28,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:28,016 INFO L793 eck$LassoCheckResult]: Stem: 3394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3323#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 3384#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3385#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3388#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 3404#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 3405#L561-1 main_#t~post12 := main_#t~mem11; 3407#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 3400#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 3401#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3328#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 3315#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 3316#L566-1 main_#t~post17 := main_#t~mem16; 3318#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 3417#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 3418#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 3439#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 3342#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 3343#L571-1 main_#t~post22 := main_#t~mem21; 3338#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 3339#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 3340#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 3422#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 3361#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 3362#L576-1 main_#t~post27 := main_#t~mem26; 3355#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 3356#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 3358#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3436#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 3377#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 3369#L581-1 main_#t~post32 := main_#t~mem31; 3370#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 3373#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 3375#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3423#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 3363#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 3364#L584-1 main_#t~post35 := main_#t~mem34; 3365#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 3366#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 3368#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3313#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 3314#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3381#L589-1 main_#t~post40 := main_#t~mem39; 3386#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3389#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 3320#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3321#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 3341#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3403#L594-1 main_#t~post45 := main_#t~mem44; 3406#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3408#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 3336#L598-8 [2018-10-27 06:07:28,016 INFO L795 eck$LassoCheckResult]: Loop: 3336#L598-8 assume true; 3344#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 3360#L598-1 main_#t~short50 := main_#t~mem48 < 100; 3353#L598-2 assume main_#t~short50; 3354#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 3357#L598-4 main_#t~short50 := main_#t~mem49 < 100; 3359#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 3311#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3312#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3317#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3319#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3379#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3380#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3383#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3387#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 3336#L598-8 [2018-10-27 06:07:28,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1901582794, now seen corresponding path program 1 times [2018-10-27 06:07:28,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:28,451 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-10-27 06:07:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:28,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:28,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-27 06:07:28,986 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:28,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 10 times [2018-10-27 06:07:28,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:29,212 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 06:07:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-27 06:07:29,235 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. cyclomatic complexity: 11 Second operand 22 states. [2018-10-27 06:07:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:29,788 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-10-27 06:07:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 06:07:29,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 169 transitions. [2018-10-27 06:07:29,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:29,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 169 transitions. [2018-10-27 06:07:29,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2018-10-27 06:07:29,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-10-27 06:07:29,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 169 transitions. [2018-10-27 06:07:29,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:29,792 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-10-27 06:07:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 169 transitions. [2018-10-27 06:07:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-10-27 06:07:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:07:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-10-27 06:07:29,795 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:07:29,795 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:07:29,795 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:07:29,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-10-27 06:07:29,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:29,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:29,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:29,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:29,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:29,807 INFO L793 eck$LassoCheckResult]: Stem: 3745#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3674#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 3734#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3735#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3738#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 3755#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 3756#L561-1 main_#t~post12 := main_#t~mem11; 3758#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 3750#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 3751#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3678#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 3679#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 3802#L566-1 main_#t~post17 := main_#t~mem16; 3800#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 3797#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 3796#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 3697#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 3692#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 3693#L571-1 main_#t~post22 := main_#t~mem21; 3687#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 3688#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 3689#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 3810#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 3712#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 3713#L576-1 main_#t~post27 := main_#t~mem26; 3706#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 3707#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 3709#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3794#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 3727#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 3720#L581-1 main_#t~post32 := main_#t~mem31; 3721#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 3724#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 3703#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3739#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 3752#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 3743#L586-1 main_#t~post37 := main_#t~mem36; 3744#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 3747#L586-3 havoc main_#t~post37;havoc main_#t~mem36; 3749#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3795#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 3663#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3731#L589-1 main_#t~post40 := main_#t~mem39; 3733#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3737#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 3740#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3690#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 3691#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3753#L594-1 main_#t~post45 := main_#t~mem44; 3754#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3757#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 3683#L598-8 [2018-10-27 06:07:29,807 INFO L795 eck$LassoCheckResult]: Loop: 3683#L598-8 assume true; 3694#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 3711#L598-1 main_#t~short50 := main_#t~mem48 < 100; 3704#L598-2 assume main_#t~short50; 3705#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 3708#L598-4 main_#t~short50 := main_#t~mem49 < 100; 3710#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 3660#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3661#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3664#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3667#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3729#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3730#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3732#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3736#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 3683#L598-8 [2018-10-27 06:07:29,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1675124912, now seen corresponding path program 1 times [2018-10-27 06:07:29,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:29,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:29,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:29,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:29,981 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:29,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 11 times [2018-10-27 06:07:29,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:29,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:29,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,196 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:30,223 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:07:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:30,347 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-10-27 06:07:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:30,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 160 transitions. [2018-10-27 06:07:30,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:30,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 160 transitions. [2018-10-27 06:07:30,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-10-27 06:07:30,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-10-27 06:07:30,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 160 transitions. [2018-10-27 06:07:30,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:30,351 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-10-27 06:07:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 160 transitions. [2018-10-27 06:07:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-27 06:07:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:07:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-10-27 06:07:30,354 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-10-27 06:07:30,355 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-10-27 06:07:30,355 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:07:30,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 160 transitions. [2018-10-27 06:07:30,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:30,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:30,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:30,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:30,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:30,357 INFO L793 eck$LassoCheckResult]: Stem: 4067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3995#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 4055#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 4056#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4059#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 4077#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 4078#L561-1 main_#t~post12 := main_#t~mem11; 4080#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 4072#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 4073#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3999#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 4000#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 4129#L566-1 main_#t~post17 := main_#t~mem16; 4127#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 4125#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 4123#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 4018#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 4013#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 4014#L571-1 main_#t~post22 := main_#t~mem21; 4008#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 4009#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 4010#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 4131#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 4032#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 4033#L576-1 main_#t~post27 := main_#t~mem26; 4026#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 4027#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 4029#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 4119#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 4047#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 4040#L581-1 main_#t~post32 := main_#t~mem31; 4041#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 4044#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 4023#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 4060#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 4074#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 4064#L586-1 main_#t~post37 := main_#t~mem36; 4065#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 4068#L586-3 havoc main_#t~post37;havoc main_#t~mem36; 4070#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4130#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 4089#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 4083#L591-1 main_#t~post42 := main_#t~mem41; 4084#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 4086#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 3990#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3991#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 4012#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 4075#L594-1 main_#t~post45 := main_#t~mem44; 4076#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 4079#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 4006#L598-8 [2018-10-27 06:07:30,357 INFO L795 eck$LassoCheckResult]: Loop: 4006#L598-8 assume true; 4015#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 4031#L598-1 main_#t~short50 := main_#t~mem48 < 100; 4024#L598-2 assume main_#t~short50; 4025#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 4028#L598-4 main_#t~short50 := main_#t~mem49 < 100; 4030#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 3981#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3982#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3987#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3989#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 4049#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 4050#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 4053#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 4057#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 4006#L598-8 [2018-10-27 06:07:30,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -108822186, now seen corresponding path program 1 times [2018-10-27 06:07:30,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:30,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:30,435 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 12 times [2018-10-27 06:07:30,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,559 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:30,584 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-10-27 06:07:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:30,758 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-10-27 06:07:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:30,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 159 transitions. [2018-10-27 06:07:30,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:30,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 159 transitions. [2018-10-27 06:07:30,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-10-27 06:07:30,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-10-27 06:07:30,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 159 transitions. [2018-10-27 06:07:30,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:30,762 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-10-27 06:07:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 159 transitions. [2018-10-27 06:07:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-27 06:07:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:07:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-10-27 06:07:30,767 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-10-27 06:07:30,767 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-10-27 06:07:30,767 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:07:30,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 159 transitions. [2018-10-27 06:07:30,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:30,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:30,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:30,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:30,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:30,769 INFO L793 eck$LassoCheckResult]: Stem: 4385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4314#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 4374#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 4375#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4378#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 4395#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 4396#L561-1 main_#t~post12 := main_#t~mem11; 4398#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 4391#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 4392#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 4319#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 4320#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 4450#L566-1 main_#t~post17 := main_#t~mem16; 4449#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 4448#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 4446#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 4338#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 4333#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 4334#L571-1 main_#t~post22 := main_#t~mem21; 4329#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 4330#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 4331#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 4452#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 4352#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 4353#L576-1 main_#t~post27 := main_#t~mem26; 4346#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 4347#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 4349#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 4442#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 4367#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 4360#L581-1 main_#t~post32 := main_#t~mem31; 4361#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 4364#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 4343#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 4380#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 4393#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 4383#L586-1 main_#t~post37 := main_#t~mem36; 4384#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 4387#L586-3 havoc main_#t~post37;havoc main_#t~mem36; 4389#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4451#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 4410#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 4402#L591-1 main_#t~post42 := main_#t~mem41; 4403#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 4405#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 4408#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 4411#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43; 4315#L596 SUMMARY for call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L596 4316#L596-1 main_#t~post47 := main_#t~mem46; 4321#L596-2 SUMMARY for call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L596-2 4323#L596-3 havoc main_#t~post47;havoc main_#t~mem46; 4327#L598-8 [2018-10-27 06:07:30,769 INFO L795 eck$LassoCheckResult]: Loop: 4327#L598-8 assume true; 4335#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 4351#L598-1 main_#t~short50 := main_#t~mem48 < 100; 4344#L598-2 assume main_#t~short50; 4345#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 4348#L598-4 main_#t~short50 := main_#t~mem49 < 100; 4350#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 4302#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 4303#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 4308#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 4310#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 4369#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 4370#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 4373#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 4377#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 4327#L598-8 [2018-10-27 06:07:30,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash -103096356, now seen corresponding path program 1 times [2018-10-27 06:07:30,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:30,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 13 times [2018-10-27 06:07:30,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:30,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash -776626025, now seen corresponding path program 1 times [2018-10-27 06:07:30,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:31,068 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:35,996 WARN L179 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 227 DAG size of output: 205 [2018-10-27 06:07:36,086 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:36,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:36,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:36,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:36,087 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:36,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:36,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:36,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:36,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration14_Lasso [2018-10-27 06:07:36,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:36,087 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:36,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,432 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2018-10-27 06:07:36,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:37,250 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:37,250 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:37,251 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 [2018-10-27 06:07:37,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:37,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:37,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:37,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,252 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 [2018-10-27 06:07:37,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:37,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:37,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:37,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,266 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 [2018-10-27 06:07:37,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:37,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:37,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:37,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,267 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 [2018-10-27 06:07:37,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:37,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,269 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 [2018-10-27 06:07:37,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,270 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:37,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,271 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:37,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,273 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 [2018-10-27 06:07:37,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:37,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,276 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 [2018-10-27 06:07:37,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:37,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,291 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 [2018-10-27 06:07:37,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,292 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:37,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,292 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:37,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:37,295 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 [2018-10-27 06:07:37,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:37,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:37,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:37,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:37,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:37,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:37,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:37,318 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:07:37,319 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:37,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:37,320 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:07:37,320 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:37,320 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = -23*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 9 >= 0] [2018-10-27 06:07:37,487 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2018-10-27 06:07:37,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:37,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:37,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:37,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:37,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:07:37,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,602 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:07:37,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-10-27 06:07:37,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:07:37,652 INFO L477 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 [2018-10-27 06:07:37,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-27 06:07:37,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:37,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 06:07:37,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:37,781 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:37,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:37,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:37,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:37,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:37,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:37,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,091 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:38,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:38,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:38,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:38,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:38,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:38,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:38,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:38,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:38,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:38,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:38,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:38,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:38,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:07:38,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 06:07:38,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:38,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:29 [2018-10-27 06:07:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:38,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:39,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-10-27 06:07:39,200 INFO L477 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 10 treesize of output 9 [2018-10-27 06:07:39,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:39,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:39,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:39,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:53 [2018-10-27 06:07:39,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:39,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 69 [2018-10-27 06:07:39,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:39,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-27 06:07:39,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:39,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:39,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:39,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:58 [2018-10-27 06:07:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:39,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.27 stem predicates 7 loop predicates [2018-10-27 06:07:39,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 159 transitions. cyclomatic complexity: 9 Second operand 35 states. [2018-10-27 06:07:40,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 159 transitions. cyclomatic complexity: 9. Second operand 35 states. Result 220 states and 229 transitions. Complement of second has 42 states. [2018-10-27 06:07:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 35 states 27 stem states 6 non-accepting loop states 2 accepting loop states [2018-10-27 06:07:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:07:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 169 transitions. [2018-10-27 06:07:40,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 169 transitions. Stem has 52 letters. Loop has 15 letters. [2018-10-27 06:07:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 169 transitions. Stem has 67 letters. Loop has 15 letters. [2018-10-27 06:07:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 169 transitions. Stem has 52 letters. Loop has 30 letters. [2018-10-27 06:07:40,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:40,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 229 transitions. [2018-10-27 06:07:40,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-10-27 06:07:40,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 167 states and 174 transitions. [2018-10-27 06:07:40,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2018-10-27 06:07:40,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-10-27 06:07:40,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 174 transitions. [2018-10-27 06:07:40,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:40,827 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 174 transitions. [2018-10-27 06:07:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 174 transitions. [2018-10-27 06:07:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2018-10-27 06:07:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-27 06:07:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-10-27 06:07:40,829 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-10-27 06:07:40,829 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-10-27 06:07:40,829 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:07:40,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 152 transitions. [2018-10-27 06:07:40,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:40,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:40,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:40,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:40,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:40,831 INFO L793 eck$LassoCheckResult]: Stem: 5255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 5185#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 5242#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 5243#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 5246#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 5265#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 5266#L561-1 main_#t~post12 := main_#t~mem11; 5268#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 5260#L561-3 havoc main_#t~mem11;havoc main_#t~post12; 5261#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 5188#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5176#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 5177#L566-1 main_#t~post17 := main_#t~mem16; 5179#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 5277#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 5312#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 5311#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 5202#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 5203#L571-1 main_#t~post22 := main_#t~mem21; 5197#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 5198#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 5199#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 5315#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 5221#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 5222#L576-1 main_#t~post27 := main_#t~mem26; 5216#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 5217#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 5196#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 5227#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 5205#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 5206#L579-1 main_#t~post30 := main_#t~mem29; 5209#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 5210#L579-3 havoc main_#t~post30;havoc main_#t~mem29; 5213#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 5248#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 5223#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 5224#L584-1 main_#t~post35 := main_#t~mem34; 5225#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 5226#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 5228#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 5173#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 5174#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 5240#L589-1 main_#t~post40 := main_#t~mem39; 5244#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 5247#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 5249#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 5200#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 5201#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 5263#L594-1 main_#t~post45 := main_#t~mem44; 5267#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 5269#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 5195#L598-8 [2018-10-27 06:07:40,831 INFO L795 eck$LassoCheckResult]: Loop: 5195#L598-8 assume true; 5204#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 5220#L598-1 main_#t~short50 := main_#t~mem48 < 100; 5214#L598-2 assume main_#t~short50; 5215#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 5218#L598-4 main_#t~short50 := main_#t~mem49 < 100; 5219#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 5171#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 5172#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 5175#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 5178#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 5238#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 5239#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 5241#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 5245#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 5195#L598-8 [2018-10-27 06:07:40,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash 28102852, now seen corresponding path program 1 times [2018-10-27 06:07:40,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:40,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:40,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:40,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:07:40,960 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:40,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 14 times [2018-10-27 06:07:40,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:40,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,101 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:41,125 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:07:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:41,225 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-10-27 06:07:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:41,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 152 transitions. [2018-10-27 06:07:41,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:41,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 123 states and 128 transitions. [2018-10-27 06:07:41,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2018-10-27 06:07:41,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-10-27 06:07:41,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 128 transitions. [2018-10-27 06:07:41,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:41,229 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-10-27 06:07:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 128 transitions. [2018-10-27 06:07:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-27 06:07:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 06:07:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-10-27 06:07:41,230 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-10-27 06:07:41,230 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-10-27 06:07:41,231 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:07:41,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 128 transitions. [2018-10-27 06:07:41,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:41,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:41,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:41,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:41,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:41,232 INFO L793 eck$LassoCheckResult]: Stem: 5539#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 5504#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 5528#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 5529#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 5532#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 5518#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 5484#L559-1 main_#t~post10 := main_#t~mem9; 5485#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 5487#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 5493#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 5508#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5495#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 5496#L566-1 main_#t~post17 := main_#t~mem16; 5498#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 5576#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 5577#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 5603#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 5544#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 5545#L571-1 main_#t~post22 := main_#t~mem21; 5519#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 5520#L571-3 havoc main_#t~post22;havoc main_#t~mem21; 5521#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 5589#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 5574#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 5575#L576-1 main_#t~post27 := main_#t~mem26; 5557#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 5558#L576-3 havoc main_#t~mem26;havoc main_#t~post27; 5560#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 5525#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 5517#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 5482#L581-1 main_#t~post32 := main_#t~mem31; 5483#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 5486#L581-3 havoc main_#t~post32;havoc main_#t~mem31; 5488#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 5584#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 5578#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 5579#L584-1 main_#t~post35 := main_#t~mem34; 5580#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 5581#L584-3 havoc main_#t~post35;havoc main_#t~mem34; 5566#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 5491#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 5492#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 5524#L589-1 main_#t~post40 := main_#t~mem39; 5527#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 5531#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 5535#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 5597#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 5561#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 5562#L594-1 main_#t~post45 := main_#t~mem44; 5564#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 5565#L594-3 havoc main_#t~post45;havoc main_#t~mem44; 5513#L598-8 [2018-10-27 06:07:41,232 INFO L795 eck$LassoCheckResult]: Loop: 5513#L598-8 assume true; 5546#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 5573#L598-1 main_#t~short50 := main_#t~mem48 < 100; 5555#L598-2 assume main_#t~short50; 5556#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 5559#L598-4 main_#t~short50 := main_#t~mem49 < 100; 5563#L598-6 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49; 5489#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 5490#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 5494#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 5497#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 5522#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 5523#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 5526#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 5530#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 5513#L598-8 [2018-10-27 06:07:41,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash -959053116, now seen corresponding path program 1 times [2018-10-27 06:07:41,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:41,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:41,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:41,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:07:41,310 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:41,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 15 times [2018-10-27 06:07:41,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:41,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:41,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:41,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,654 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-27 06:07:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:07:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:07:41,694 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:07:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:41,704 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2018-10-27 06:07:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:41,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 5 transitions. [2018-10-27 06:07:41,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:41,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 0 states and 0 transitions. [2018-10-27 06:07:41,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:41,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:41,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:41,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:41,704 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:41,705 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:41,705 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:41,705 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:07:41,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:41,705 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:41,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:41,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:41 BoogieIcfgContainer [2018-10-27 06:07:41,712 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:41,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:41,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:41,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:41,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07" (3/4) ... [2018-10-27 06:07:41,720 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:41,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:41,721 INFO L168 Benchmark]: Toolchain (without parser) took 35785.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.1 MB). Free memory was 958.5 MB in the beginning and 1.4 GB in the end (delta: -484.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:41,721 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:41,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.43 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 936.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:41,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:41,722 INFO L168 Benchmark]: Boogie Preprocessor took 27.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:41,722 INFO L168 Benchmark]: RCFGBuilder took 890.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:41,723 INFO L168 Benchmark]: BuchiAutomizer took 34275.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -356.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:41,723 INFO L168 Benchmark]: Witness Printer took 7.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:41,725 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.43 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 936.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 890.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34275.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -356.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 7.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (14 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 207 and consists of 38 locations. One deterministic module has affine ranking function -23 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[z][z] and consists of 35 locations. 14 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.2s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 22.0s. Construction of modules took 3.0s. Büchi inclusion checks took 8.8s. Highest rank in rank-based complementation 3. Minimization of det autom 16. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 83 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 156 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1368 SDtfs, 714 SDslu, 7224 SDs, 0 SdLazy, 4297 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU13 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp89 ukn79 mio100 lsp36 div100 bol100 ite100 ukn100 eq205 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! Received shutdown request...