./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i -s /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/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 18b42b65120149c30866fbc5b5479df029781f63 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:23:20,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:23:20,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:23:20,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:23:20,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:23:20,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:23:20,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:23:20,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:23:20,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:23:20,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:23:20,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:23:20,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:23:20,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:23:20,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:23:20,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:23:20,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:23:20,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:23:20,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:23:20,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:23:20,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:23:20,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:23:20,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:23:20,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:23:20,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:23:20,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:23:20,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:23:20,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:23:20,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:23:20,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:23:20,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:23:20,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:23:20,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:23:20,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:23:20,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:23:20,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:23:20,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:23:20,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:23:20,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:23:20,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:23:20,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:23:20,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:23:20,564 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:23:20,598 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:23:20,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:23:20,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:23:20,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:23:20,610 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:23:20,610 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:23:20,610 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:23:20,611 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:23:20,611 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:23:20,611 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:23:20,611 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:23:20,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:23:20,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:23:20,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:23:20,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:23:20,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:23:20,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:23:20,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:23:20,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:23:20,619 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:23:20,619 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:23:20,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:23:20,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:23:20,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:23:20,620 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:23:20,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:23:20,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:23:20,621 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:23:20,622 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:23:20,626 INFO L138 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/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2019-11-15 21:23:20,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:23:20,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:23:20,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:23:20,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:23:20,686 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:23:20,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2019-11-15 21:23:20,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/data/167613a1f/0f9fbed5329f4e5fa98e5636dbff9fd2/FLAG7317d6fed [2019-11-15 21:23:21,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:23:21,235 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2019-11-15 21:23:21,242 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/data/167613a1f/0f9fbed5329f4e5fa98e5636dbff9fd2/FLAG7317d6fed [2019-11-15 21:23:21,585 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/uautomizer/data/167613a1f/0f9fbed5329f4e5fa98e5636dbff9fd2 [2019-11-15 21:23:21,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:23:21,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:23:21,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:23:21,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:23:21,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:23:21,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:23:21" (1/1) ... [2019-11-15 21:23:21,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8f4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:21, skipping insertion in model container [2019-11-15 21:23:21,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:23:21" (1/1) ... [2019-11-15 21:23:21,608 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:23:21,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:23:21,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:23:21,980 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:23:22,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:23:22,026 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:23:22,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22 WrapperNode [2019-11-15 21:23:22,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:23:22,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:23:22,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:23:22,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:23:22,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:23:22,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:23:22,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:23:22,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:23:22,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... [2019-11-15 21:23:22,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:23:22,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:23:22,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:23:22,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:23:22,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_361c865c-6756-43fd-819b-8a937da4b25f/bin/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 [2019-11-15 21:23:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:23:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 21:23:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 21:23:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:23:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:23:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:23:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:23:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:23:22,441 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:23:22,441 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:23:22,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:23:22 BoogieIcfgContainer [2019-11-15 21:23:22,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:23:22,443 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:23:22,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:23:22,448 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:23:22,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:23:22,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:23:21" (1/3) ... [2019-11-15 21:23:22,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74ec7f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:23:22, skipping insertion in model container [2019-11-15 21:23:22,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:23:22,452 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:23:22" (2/3) ... [2019-11-15 21:23:22,452 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74ec7f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:23:22, skipping insertion in model container [2019-11-15 21:23:22,453 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:23:22,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:23:22" (3/3) ... [2019-11-15 21:23:22,455 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B.i [2019-11-15 21:23:22,558 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:23:22,558 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:23:22,559 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:23:22,559 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:23:22,559 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:23:22,559 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:23:22,559 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:23:22,560 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:23:22,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 21:23:22,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 21:23:22,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:22,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:22,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:23:22,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:22,626 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:23:22,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 21:23:22,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 21:23:22,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:22,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:22,630 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:23:22,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:22,638 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2019-11-15 21:23:22,638 INFO L793 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 19#L28-3true [2019-11-15 21:23:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 21:23:22,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:22,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544959966] [2019-11-15 21:23:22,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2019-11-15 21:23:22,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:22,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900626202] [2019-11-15 21:23:22,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2019-11-15 21:23:22,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:22,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939963745] [2019-11-15 21:23:22,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:22,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:22,982 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:23,248 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:23:23,832 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-11-15 21:23:24,077 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-11-15 21:23:24,138 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:23:24,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:23:24,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:23:24,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:23:24,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:23:24,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:23:24,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:23:24,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:23:24,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration1_Lasso [2019-11-15 21:23:24,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:23:24,142 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:23:24,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,636 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-15 21:23:24,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:24,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:25,223 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:23:25,230 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:23:25,232 INFO L120 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 [2019-11-15 21:23:25,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:25,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:25,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:25,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:25,242 INFO L120 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 [2019-11-15 21:23:25,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:25,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:25,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:25,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:25,247 INFO L120 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 [2019-11-15 21:23:25,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:25,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:25,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:25,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:25,251 INFO L120 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 [2019-11-15 21:23:25,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:25,256 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:25,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:25,261 INFO L120 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 [2019-11-15 21:23:25,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,267 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:25,267 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:25,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:25,314 INFO L120 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 [2019-11-15 21:23:25,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:25,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:25,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:25,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:25,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:25,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:25,365 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:23:25,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:23:25,390 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:23:25,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:23:25,395 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:23:25,395 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:23:25,396 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-15 21:23:25,410 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:23:25,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:23:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:25,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:23:25,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:25,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:23:25,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:25,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:25,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:23:25,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:25,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:25,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:23:25,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-15 21:23:25,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:25,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:25,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:25,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2019-11-15 21:23:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:25,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 21:23:25,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2019-11-15 21:23:25,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2019-11-15 21:23:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 21:23:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:23:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2019-11-15 21:23:25,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2019-11-15 21:23:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2019-11-15 21:23:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2019-11-15 21:23:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:25,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2019-11-15 21:23:25,986 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 21:23:25,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2019-11-15 21:23:25,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 21:23:25,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 21:23:25,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2019-11-15 21:23:25,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:23:25,998 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-11-15 21:23:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2019-11-15 21:23:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-15 21:23:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 21:23:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-11-15 21:23:26,035 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-11-15 21:23:26,035 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-11-15 21:23:26,035 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:23:26,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2019-11-15 21:23:26,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 21:23:26,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:26,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:26,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:26,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:23:26,041 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-11-15 21:23:26,042 INFO L793 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-11-15 21:23:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2019-11-15 21:23:26,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:26,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760048036] [2019-11-15 21:23:26,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,114 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2019-11-15 21:23:26,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:26,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116348979] [2019-11-15 21:23:26,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2019-11-15 21:23:26,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:26,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509293136] [2019-11-15 21:23:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:26,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:26,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:26,470 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 21:23:26,686 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 21:23:26,899 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 21:23:27,346 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-11-15 21:23:27,475 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 21:23:28,090 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2019-11-15 21:23:28,259 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 21:23:28,263 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:23:28,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:23:28,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:23:28,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:23:28,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:23:28,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:23:28,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:23:28,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:23:28,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration2_Lasso [2019-11-15 21:23:28,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:23:28,265 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:23:28,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,446 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-15 21:23:28,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:28,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:29,080 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 21:23:29,169 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:23:29,169 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:23:29,170 INFO L120 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 [2019-11-15 21:23:29,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,175 INFO L120 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 [2019-11-15 21:23:29,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,178 INFO L120 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 [2019-11-15 21:23:29,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,182 INFO L120 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 [2019-11-15 21:23:29,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,185 INFO L120 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 [2019-11-15 21:23:29,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,189 INFO L120 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 [2019-11-15 21:23:29,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,190 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:29,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,191 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:29,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:29,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,193 INFO L120 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 [2019-11-15 21:23:29,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,213 INFO L120 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 [2019-11-15 21:23:29,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,218 INFO L120 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 [2019-11-15 21:23:29,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,220 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,220 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,234 INFO L120 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 [2019-11-15 21:23:29,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,239 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,257 INFO L120 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 [2019-11-15 21:23:29,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,275 INFO L120 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 [2019-11-15 21:23:29,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,276 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 21:23:29,277 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:23:29,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,285 INFO L400 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-11-15 21:23:29,286 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:23:29,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:29,353 INFO L120 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 [2019-11-15 21:23:29,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:29,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:29,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:29,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:29,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:29,366 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:29,403 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:23:29,420 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:23:29,421 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:23:29,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:23:29,423 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:23:29,423 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:23:29,424 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-11-15 21:23:29,434 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 21:23:29,439 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:23:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:29,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:23:29,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:29,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:23:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:29,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:29,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 21:23:29,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:29,628 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 21:23:29,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:29,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 21:23:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:29,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:23:29,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 21:23:29,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 128 states and 165 transitions. Complement of second has 17 states. [2019-11-15 21:23:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:23:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:23:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 21:23:29,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 21:23:29,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:29,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:23:29,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:29,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 21:23:29,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:29,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2019-11-15 21:23:29,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-15 21:23:29,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2019-11-15 21:23:29,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-11-15 21:23:29,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-11-15 21:23:29,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2019-11-15 21:23:29,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:23:29,783 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-11-15 21:23:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2019-11-15 21:23:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-15 21:23:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:23:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2019-11-15 21:23:29,801 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-11-15 21:23:29,801 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-11-15 21:23:29,802 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:23:29,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2019-11-15 21:23:29,805 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-15 21:23:29,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:29,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:29,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:29,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:29,807 INFO L791 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 443#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 470#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 494#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 504#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 516#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 515#recFINAL assume true; 493#recEXIT >#39#return; 453#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 438#L33-3 [2019-11-15 21:23:29,808 INFO L793 eck$LassoCheckResult]: Loop: 438#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 439#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 485#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 476#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 497#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 489#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 490#recFINAL assume true; 475#recEXIT >#39#return; 472#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 438#L33-3 [2019-11-15 21:23:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2019-11-15 21:23:29,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:29,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393103604] [2019-11-15 21:23:29,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:29,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:29,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:29,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393103604] [2019-11-15 21:23:29,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:23:29,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:23:29,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127776618] [2019-11-15 21:23:29,925 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:23:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2019-11-15 21:23:29,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:29,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635314175] [2019-11-15 21:23:29,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:29,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:29,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:29,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:30,504 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-11-15 21:23:30,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:23:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:23:30,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:23:30,609 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 6 states. [2019-11-15 21:23:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:23:30,670 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2019-11-15 21:23:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:23:30,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2019-11-15 21:23:30,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 21:23:30,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2019-11-15 21:23:30,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-15 21:23:30,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-15 21:23:30,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2019-11-15 21:23:30,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:23:30,680 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2019-11-15 21:23:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2019-11-15 21:23:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-15 21:23:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 21:23:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-11-15 21:23:30,692 INFO L711 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-11-15 21:23:30,692 INFO L591 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-11-15 21:23:30,692 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:23:30,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2019-11-15 21:23:30,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 21:23:30,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:30,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:30,696 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:30,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:30,697 INFO L791 eck$LassoCheckResult]: Stem: 669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 659#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 660#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 683#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 703#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 707#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 705#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 665#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 700#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 701#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 717#recFINAL assume true; 709#recEXIT >#37#return; 706#L19-1 #res := #t~ret5;havoc #t~ret5; 704#recFINAL assume true; 702#recEXIT >#39#return; 667#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 655#L33-3 [2019-11-15 21:23:30,697 INFO L793 eck$LassoCheckResult]: Loop: 655#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 656#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 695#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 692#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 694#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 698#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 697#recFINAL assume true; 696#recEXIT >#39#return; 685#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 655#L33-3 [2019-11-15 21:23:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2019-11-15 21:23:30,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:30,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070783372] [2019-11-15 21:23:30,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:30,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:23:30,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070783372] [2019-11-15 21:23:30,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:23:30,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:23:30,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699259801] [2019-11-15 21:23:30,797 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:23:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2019-11-15 21:23:30,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:30,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241417092] [2019-11-15 21:23:30,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:30,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:30,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:30,832 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:31,262 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-11-15 21:23:31,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:23:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:23:31,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:23:31,344 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 7 states. [2019-11-15 21:23:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:23:31,423 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-15 21:23:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:23:31,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2019-11-15 21:23:31,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:23:31,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2019-11-15 21:23:31,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:23:31,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:23:31,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2019-11-15 21:23:31,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:23:31,429 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-11-15 21:23:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2019-11-15 21:23:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-15 21:23:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 21:23:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-11-15 21:23:31,436 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-11-15 21:23:31,436 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-11-15 21:23:31,436 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:23:31,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2019-11-15 21:23:31,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:23:31,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:23:31,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:23:31,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:23:31,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:23:31,439 INFO L791 eck$LassoCheckResult]: Stem: 855#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 850#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 844#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 845#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 869#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 876#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 858#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 878#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 882#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 880#recFINAL assume true; 861#recEXIT >#37#return; 862#L19-1 #res := #t~ret5;havoc #t~ret5; 874#recFINAL assume true; 870#recEXIT >#39#return; 854#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 846#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 847#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 843#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 836#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 835#recENTRY [2019-11-15 21:23:31,439 INFO L793 eck$LassoCheckResult]: Loop: 835#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 837#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 838#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 835#recENTRY [2019-11-15 21:23:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2019-11-15 21:23:31,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:31,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308082468] [2019-11-15 21:23:31,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,488 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2019-11-15 21:23:31,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:31,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893916971] [2019-11-15 21:23:31,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2019-11-15 21:23:31,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:31,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544283677] [2019-11-15 21:23:31,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:31,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:23:31,569 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:23:31,779 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 21:23:31,996 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 21:23:32,637 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-11-15 21:23:32,841 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:23:35,070 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 215 DAG size of output: 183 [2019-11-15 21:23:35,366 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 21:23:35,758 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-15 21:23:35,984 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-15 21:23:35,987 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:23:35,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:23:35,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:23:35,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:23:35,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:23:35,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:23:35,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:23:35,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:23:35,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration5_Lasso [2019-11-15 21:23:35,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:23:35,988 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:23:35,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:35,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,218 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-15 21:23:36,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:36,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:23:37,094 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:23:37,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:23:37,175 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:23:37,175 INFO L120 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 [2019-11-15 21:23:37,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,180 INFO L120 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 [2019-11-15 21:23:37,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,182 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,184 INFO L120 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 [2019-11-15 21:23:37,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,194 INFO L120 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 [2019-11-15 21:23:37,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,197 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,202 INFO L120 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 [2019-11-15 21:23:37,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,206 INFO L120 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 [2019-11-15 21:23:37,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,210 INFO L120 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 [2019-11-15 21:23:37,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,213 INFO L120 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 [2019-11-15 21:23:37,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,216 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,227 INFO L120 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 [2019-11-15 21:23:37,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,228 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,229 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,230 INFO L120 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 [2019-11-15 21:23:37,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,233 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,236 INFO L120 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 [2019-11-15 21:23:37,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,239 INFO L120 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 [2019-11-15 21:23:37,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,241 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,242 INFO L120 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 [2019-11-15 21:23:37,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,245 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,247 INFO L120 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 [2019-11-15 21:23:37,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:23:37,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:23:37,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:23:37,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,250 INFO L120 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 [2019-11-15 21:23:37,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,254 INFO L120 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 [2019-11-15 21:23:37,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,263 INFO L120 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 [2019-11-15 21:23:37,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,266 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,268 INFO L120 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 [2019-11-15 21:23:37,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,270 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,272 INFO L120 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 [2019-11-15 21:23:37,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,274 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-15 21:23:37,274 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:23:37,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,282 INFO L400 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-11-15 21:23:37,282 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:23:37,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,338 INFO L120 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 [2019-11-15 21:23:37,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,341 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,341 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:23:37,348 INFO L120 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 [2019-11-15 21:23:37,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:23:37,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:23:37,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:23:37,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:23:37,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:23:37,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:23:37,364 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:23:37,381 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:23:37,381 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:23:37,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:23:37,383 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:23:37,383 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:23:37,383 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-11-15 21:23:37,402 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 21:23:37,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:23:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:23:37,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:23:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:23:37,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:37,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:37,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 21:23:37,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:37,616 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 21:23:37,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:37,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 21:23:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:37,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:23:37,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 21:23:37,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-11-15 21:23:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:23:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:23:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 21:23:37,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 21:23:37,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:37,735 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:23:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:23:37,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:37,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:23:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:23:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:37,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:37,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 21:23:37,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:37,916 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 21:23:37,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:37,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 21:23:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:37,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:23:37,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 21:23:38,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-11-15 21:23:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:23:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:23:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 21:23:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 21:23:38,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:38,006 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:23:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:23:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:38,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:23:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:23:38,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:38,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:38,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 21:23:38,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:38,263 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 21:23:38,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:38,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 21:23:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:23:38,279 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:23:38,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 21:23:38,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2019-11-15 21:23:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:23:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:23:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 21:23:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 21:23:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2019-11-15 21:23:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-15 21:23:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:23:38,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2019-11-15 21:23:38,399 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:23:38,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2019-11-15 21:23:38,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:23:38,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:23:38,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:23:38,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:23:38,400 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:23:38,400 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:23:38,400 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:23:38,400 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:23:38,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:23:38,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:23:38,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:23:38,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:23:38 BoogieIcfgContainer [2019-11-15 21:23:38,411 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:23:38,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:23:38,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:23:38,412 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:23:38,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:23:22" (3/4) ... [2019-11-15 21:23:38,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:23:38,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:23:38,427 INFO L168 Benchmark]: Toolchain (without parser) took 16830.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -103.0 MB). Peak memory consumption was 128.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:23:38,427 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:23:38,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:23:38,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:23:38,430 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:23:38,430 INFO L168 Benchmark]: RCFGBuilder took 344.82 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:23:38,432 INFO L168 Benchmark]: BuchiAutomizer took 15967.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 72.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:23:38,432 INFO L168 Benchmark]: Witness Printer took 6.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:23:38,436 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.82 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15967.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 72.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 61 SDslu, 119 SDs, 0 SdLazy, 197 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn44 mio100 lsp29 div100 bol100 ite100 ukn100 eq180 hnf92 smp100 dnf416 smp89 tf100 neg87 sie149 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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...