./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 160024a3cc4acfbc7213f984e87ef0c708b94aaf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:19:59,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:19:59,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:19:59,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:19:59,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:19:59,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:19:59,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:19:59,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:19:59,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:19:59,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:19:59,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:19:59,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:19:59,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:19:59,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:19:59,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:19:59,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:19:59,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:19:59,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:19:59,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:19:59,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:19:59,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:19:59,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:19:59,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:19:59,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:19:59,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:19:59,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:19:59,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:19:59,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:19:59,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:19:59,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:19:59,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:19:59,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:19:59,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:19:59,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:19:59,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:19:59,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:19:59,403 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 23:19:59,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:19:59,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:19:59,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:19:59,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:19:59,413 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:19:59,413 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:19:59,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:19:59,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:19:59,415 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:19:59,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:19:59,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:19:59,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:19:59,418 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:19:59,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:19:59,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:19:59,418 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:19:59,419 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:19:59,419 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2018-11-09 23:19:59,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:19:59,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:19:59,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:19:59,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:19:59,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:19:59,451 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-09 23:19:59,486 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/data/a0c35bff1/bd5683e3ed3e4e52ba2f9f81994b3462/FLAG053c48b2d [2018-11-09 23:19:59,900 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:19:59,900 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-09 23:19:59,906 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/data/a0c35bff1/bd5683e3ed3e4e52ba2f9f81994b3462/FLAG053c48b2d [2018-11-09 23:19:59,916 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/data/a0c35bff1/bd5683e3ed3e4e52ba2f9f81994b3462 [2018-11-09 23:19:59,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:19:59,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:19:59,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:19:59,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:19:59,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:19:59,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:59" (1/1) ... [2018-11-09 23:19:59,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:59, skipping insertion in model container [2018-11-09 23:19:59,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:59" (1/1) ... [2018-11-09 23:19:59,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:19:59,959 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:20:00,127 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:20:00,136 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:20:00,160 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:20:00,191 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:20:00,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00 WrapperNode [2018-11-09 23:20:00,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:20:00,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:20:00,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:20:00,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:20:00,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:20:00,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:20:00,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:20:00,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:20:00,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... [2018-11-09 23:20:00,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:20:00,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:20:00,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:20:00,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:20:00,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03b38d9-f382-4771-b647-5fcf64f693fc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:20:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 23:20:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 23:20:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:20:00,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:20:00,564 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:20:00,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:00 BoogieIcfgContainer [2018-11-09 23:20:00,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:20:00,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:20:00,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:20:00,568 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:20:00,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:20:00,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:19:59" (1/3) ... [2018-11-09 23:20:00,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bb8b689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:20:00, skipping insertion in model container [2018-11-09 23:20:00,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:20:00,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:00" (2/3) ... [2018-11-09 23:20:00,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bb8b689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:20:00, skipping insertion in model container [2018-11-09 23:20:00,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:20:00,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:00" (3/3) ... [2018-11-09 23:20:00,572 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2018-11-09 23:20:00,616 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:20:00,617 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:20:00,617 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:20:00,617 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:20:00,617 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:20:00,618 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:20:00,618 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:20:00,618 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:20:00,618 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:20:00,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-09 23:20:00,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-09 23:20:00,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:00,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:00,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:20:00,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-09 23:20:00,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-09 23:20:00,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:00,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:00,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,668 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset; 34#L551true SUMMARY for call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L551 39#L551-1true SUMMARY for call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L551-1 11#L552true SUMMARY for call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L552 28#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 17#L553-5true SUMMARY for call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L553-5 25#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 31#L555-3true [2018-11-09 23:20:00,668 INFO L795 eck$LassoCheckResult]: Loop: 31#L555-3true assume true; 5#L555true SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 7#L555-1true assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 21#L556true SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 23#L556-1true SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 26#L556-2true havoc gcd_#t~mem10; 32#L557-5true assume !true; 37#L557-6true SUMMARY for call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-6 16#L559true SUMMARY for call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L559 3#L559-1true havoc gcd_#t~mem15; 41#L560true SUMMARY for call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L560 42#L560-1true SUMMARY for call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L560-1 19#L560-2true havoc gcd_#t~mem16; 31#L555-3true [2018-11-09 23:20:00,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 57296372, now seen corresponding path program 1 times [2018-11-09 23:20:00,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1267956075, now seen corresponding path program 1 times [2018-11-09 23:20:00,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:00,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:00,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:20:00,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:20:00,820 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:20:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 23:20:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 23:20:00,834 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-09 23:20:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:20:00,840 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-09 23:20:00,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 23:20:00,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2018-11-09 23:20:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-09 23:20:00,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 37 transitions. [2018-11-09 23:20:00,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-09 23:20:00,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-09 23:20:00,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 37 transitions. [2018-11-09 23:20:00,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:20:00,849 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-09 23:20:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 37 transitions. [2018-11-09 23:20:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-09 23:20:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-09 23:20:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-09 23:20:00,867 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-09 23:20:00,867 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-09 23:20:00,867 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:20:00,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2018-11-09 23:20:00,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-09 23:20:00,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:00,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:00,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:00,870 INFO L793 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset; 99#L551 SUMMARY for call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L551 119#L551-1 SUMMARY for call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L551-1 102#L552 SUMMARY for call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L552 103#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 107#L553-5 SUMMARY for call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L553-5 108#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 105#L555-3 [2018-11-09 23:20:00,870 INFO L795 eck$LassoCheckResult]: Loop: 105#L555-3 assume true; 93#L555 SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 94#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 95#L556 SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 112#L556-1 SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 114#L556-2 havoc gcd_#t~mem10; 115#L557-5 assume true; 90#L557-1 SUMMARY for call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L557-1 91#L557-2 SUMMARY for call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-2 92#L557-3 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 97#L557-6 SUMMARY for call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-6 106#L559 SUMMARY for call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L559 88#L559-1 havoc gcd_#t~mem15; 89#L560 SUMMARY for call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L560 121#L560-1 SUMMARY for call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L560-1 110#L560-2 havoc gcd_#t~mem16; 105#L555-3 [2018-11-09 23:20:00,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:00,870 INFO L82 PathProgramCache]: Analyzing trace with hash 57296372, now seen corresponding path program 2 times [2018-11-09 23:20:00,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:00,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347501, now seen corresponding path program 1 times [2018-11-09 23:20:00,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:20:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash -996625504, now seen corresponding path program 1 times [2018-11-09 23:20:00,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:00,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:00,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:00,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:01,366 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2018-11-09 23:20:01,469 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:20:01,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:20:01,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:20:01,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:20:01,470 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:20:01,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:20:01,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:20:01,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:20:01,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-09 23:20:01,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:20:01,471 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:20:01,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,851 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2018-11-09 23:20:01,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:01,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:02,120 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-09 23:20:02,448 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:20:02,452 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:20:02,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:02,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:02,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:02,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:02,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:02,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:02,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:02,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:02,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:02,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:02,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,474 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:20:02,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,476 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:20:02,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:02,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:02,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:02,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:02,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:02,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:02,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:02,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:02,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:02,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:02,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:02,571 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:20:02,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 23:20:02,581 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:20:02,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:20:02,583 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:20:02,583 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:20:02,584 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-09 23:20:02,653 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 23:20:02,657 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:02,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:02,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:02,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:02,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 23:20:02,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:02,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:02,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 23:20:02,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:02,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:02,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:02,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 23:20:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:02,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:02,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-09 23:20:02,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-09 23:20:02,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:02,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 28 [2018-11-09 23:20:02,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:02,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:02,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:02,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:34 [2018-11-09 23:20:03,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 51 [2018-11-09 23:20:03,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-09 23:20:03,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:03,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 37 [2018-11-09 23:20:03,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,112 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:53 [2018-11-09 23:20:03,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:03,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2018-11-09 23:20:03,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-09 23:20:03,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:03,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:03,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:03,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2018-11-09 23:20:03,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:03,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-09 23:20:03,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:03,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:03,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:03,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-09 23:20:03,338 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:89, output treesize:99 [2018-11-09 23:20:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:03,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-09 23:20:03,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 37 transitions. cyclomatic complexity: 4 Second operand 13 states. [2018-11-09 23:20:03,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 37 transitions. cyclomatic complexity: 4. Second operand 13 states. Result 75 states and 81 transitions. Complement of second has 21 states. [2018-11-09 23:20:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-09 23:20:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2018-11-09 23:20:03,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-09 23:20:03,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:03,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 24 letters. Loop has 16 letters. [2018-11-09 23:20:03,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:03,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 8 letters. Loop has 32 letters. [2018-11-09 23:20:03,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:03,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2018-11-09 23:20:03,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-09 23:20:03,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 76 transitions. [2018-11-09 23:20:03,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-09 23:20:03,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-09 23:20:03,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 76 transitions. [2018-11-09 23:20:03,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:20:03,638 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-09 23:20:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 76 transitions. [2018-11-09 23:20:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-09 23:20:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-09 23:20:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-11-09 23:20:03,641 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-09 23:20:03,641 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-09 23:20:03,641 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:20:03,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 75 transitions. [2018-11-09 23:20:03,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-09 23:20:03,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:03,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:03,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:03,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:03,643 INFO L793 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset; 445#L551 SUMMARY for call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L551 477#L551-1 SUMMARY for call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L551-1 448#L552 SUMMARY for call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L552 449#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 454#L553-5 SUMMARY for call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L553-5 455#L554 assume gcd_#t~mem7 < 0;havoc gcd_#t~mem7; 446#L554-1 SUMMARY for call gcd_#t~mem8 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L554-1 447#L554-2 SUMMARY for call write~int(-gcd_#t~mem8, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L554-2 450#L554-3 havoc gcd_#t~mem8; 451#L555-3 [2018-11-09 23:20:03,643 INFO L795 eck$LassoCheckResult]: Loop: 451#L555-3 assume true; 493#L555 SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 492#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 491#L556 SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 489#L556-1 SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 486#L556-2 havoc gcd_#t~mem10; 485#L557-5 assume true; 484#L557-1 SUMMARY for call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L557-1 483#L557-2 SUMMARY for call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-2 481#L557-3 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 476#L557-6 SUMMARY for call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-6 452#L559 SUMMARY for call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L559 425#L559-1 havoc gcd_#t~mem15; 426#L560 SUMMARY for call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L560 479#L560-1 SUMMARY for call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L560-1 458#L560-2 havoc gcd_#t~mem16; 451#L555-3 [2018-11-09 23:20:03,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1814071685, now seen corresponding path program 1 times [2018-11-09 23:20:03,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:03,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347501, now seen corresponding path program 2 times [2018-11-09 23:20:03,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:03,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash 648000817, now seen corresponding path program 1 times [2018-11-09 23:20:03,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:03,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:20:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:03,961 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2018-11-09 23:20:04,031 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:20:04,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:20:04,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:20:04,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:20:04,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:20:04,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:20:04,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:20:04,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:20:04,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-09 23:20:04,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:20:04,032 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:20:04,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,325 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 105 [2018-11-09 23:20:04,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:04,795 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:20:04,795 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:20:04,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:04,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:04,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:04,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,866 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:20:04,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,867 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:20:04,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,871 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:20:04,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,872 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:20:04,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:04,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:04,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:04,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:04,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:04,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:04,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:20:04,919 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:20:04,919 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-09 23:20:04,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:20:04,920 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:20:04,920 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:20:04,921 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-09 23:20:05,015 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 23:20:05,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:05,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:05,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:05,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 23:20:05,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 23:20:05,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 23:20:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:05,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:05,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-09 23:20:05,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 28 [2018-11-09 23:20:05,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-09 23:20:05,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:34 [2018-11-09 23:20:05,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 51 [2018-11-09 23:20:05,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-09 23:20:05,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 37 [2018-11-09 23:20:05,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:53 [2018-11-09 23:20:05,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2018-11-09 23:20:05,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-09 23:20:05,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:05,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2018-11-09 23:20:05,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 23:20:05,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-09 23:20:05,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:05,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:05,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-09 23:20:05,621 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:89, output treesize:99 [2018-11-09 23:20:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:05,672 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-09 23:20:05,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-09 23:20:05,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 75 transitions. cyclomatic complexity: 9. Second operand 13 states. Result 90 states and 98 transitions. Complement of second has 21 states. [2018-11-09 23:20:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-09 23:20:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2018-11-09 23:20:05,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 11 letters. Loop has 16 letters. [2018-11-09 23:20:05,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:05,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 27 letters. Loop has 16 letters. [2018-11-09 23:20:05,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:05,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 11 letters. Loop has 32 letters. [2018-11-09 23:20:05,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:05,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 98 transitions. [2018-11-09 23:20:05,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-09 23:20:05,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 93 transitions. [2018-11-09 23:20:05,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-09 23:20:05,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-09 23:20:05,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 93 transitions. [2018-11-09 23:20:05,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:20:05,863 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-11-09 23:20:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 93 transitions. [2018-11-09 23:20:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2018-11-09 23:20:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-09 23:20:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-09 23:20:05,866 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-09 23:20:05,866 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-09 23:20:05,866 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:20:05,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 54 transitions. [2018-11-09 23:20:05,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:20:05,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:05,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:05,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:05,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:05,867 INFO L793 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset; 839#L551 SUMMARY for call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L551 867#L551-1 SUMMARY for call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L551-1 842#L552 SUMMARY for call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L552 843#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 847#L553-5 SUMMARY for call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L553-5 848#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 845#L555-3 assume true; 829#L555 SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 830#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 836#L556 SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 858#L556-1 SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 862#L556-2 havoc gcd_#t~mem10; 860#L557-5 [2018-11-09 23:20:05,867 INFO L795 eck$LassoCheckResult]: Loop: 860#L557-5 assume true; 823#L557-1 SUMMARY for call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L557-1 824#L557-2 SUMMARY for call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-2 827#L557-3 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 833#L558 SUMMARY for call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L558 849#L558-1 SUMMARY for call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L558-1 854#L558-2 SUMMARY for call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L558-2 856#L558-3 havoc gcd_#t~mem14;havoc gcd_#t~mem13; 860#L557-5 [2018-11-09 23:20:05,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -183599656, now seen corresponding path program 1 times [2018-11-09 23:20:05,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:05,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1742720554, now seen corresponding path program 1 times [2018-11-09 23:20:05,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:05,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1587184897, now seen corresponding path program 1 times [2018-11-09 23:20:05,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:05,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:05,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:06,158 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2018-11-09 23:20:06,288 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-09 23:20:06,290 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:20:06,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:20:06,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:20:06,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:20:06,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:20:06,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:20:06,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:20:06,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:20:06,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-09 23:20:06,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:20:06,290 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:20:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,552 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2018-11-09 23:20:06,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:06,926 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:20:06,926 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:20:06,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:06,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:06,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:06,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:20:06,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,964 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:20:06,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:06,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:06,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:06,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:06,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:06,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:06,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:06,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:06,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:20:07,004 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:20:07,004 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-09 23:20:07,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:20:07,006 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-09 23:20:07,006 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:20:07,006 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2018-11-09 23:20:07,099 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed [2018-11-09 23:20:07,104 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:07,104 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:07,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:07,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:07,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-09 23:20:07,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:07,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:07,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 23:20:07,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-09 23:20:07,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 23:20:07,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:07,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-09 23:20:07,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 23:20:07,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:07,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:07,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-09 23:20:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:07,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:07,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:07,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-11-09 23:20:07,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:07,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-09 23:20:07,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:07,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:07,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:07,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:50 [2018-11-09 23:20:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:07,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-09 23:20:07,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-09 23:20:07,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 7. Second operand 12 states. Result 96 states and 104 transitions. Complement of second has 18 states. [2018-11-09 23:20:07,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-09 23:20:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2018-11-09 23:20:07,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-09 23:20:07,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:07,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-09 23:20:07,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:07,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 14 letters. Loop has 16 letters. [2018-11-09 23:20:07,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:07,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 104 transitions. [2018-11-09 23:20:07,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:20:07,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 69 states and 75 transitions. [2018-11-09 23:20:07,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-09 23:20:07,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-09 23:20:07,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 75 transitions. [2018-11-09 23:20:07,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:20:07,379 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-09 23:20:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 75 transitions. [2018-11-09 23:20:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-09 23:20:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-09 23:20:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-09 23:20:07,382 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-09 23:20:07,382 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-09 23:20:07,382 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:20:07,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 73 transitions. [2018-11-09 23:20:07,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:20:07,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:20:07,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:20:07,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:07,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:20:07,384 INFO L793 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset; 1187#L551 SUMMARY for call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L551 1218#L551-1 SUMMARY for call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L551-1 1190#L552 SUMMARY for call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L552 1191#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1195#L553-5 SUMMARY for call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L553-5 1196#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1193#L555-3 assume true; 1217#L555 SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 1234#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 1232#L556 SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 1230#L556-1 SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 1228#L556-2 havoc gcd_#t~mem10; 1227#L557-5 assume true; 1174#L557-1 SUMMARY for call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L557-1 1175#L557-2 SUMMARY for call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-2 1177#L557-3 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 1183#L557-6 SUMMARY for call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-6 1194#L559 SUMMARY for call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L559 1170#L559-1 havoc gcd_#t~mem15; 1171#L560 SUMMARY for call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L560 1220#L560-1 SUMMARY for call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L560-1 1200#L560-2 havoc gcd_#t~mem16; 1202#L555-3 assume true; 1178#L555 SUMMARY for call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L555 1179#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9; 1184#L556 SUMMARY for call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); srcloc: L556 1207#L556-1 SUMMARY for call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L556-1 1211#L556-2 havoc gcd_#t~mem10; 1209#L557-5 [2018-11-09 23:20:07,384 INFO L795 eck$LassoCheckResult]: Loop: 1209#L557-5 assume true; 1172#L557-1 SUMMARY for call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L557-1 1173#L557-2 SUMMARY for call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L557-2 1176#L557-3 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 1182#L558 SUMMARY for call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L558 1197#L558-1 SUMMARY for call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); srcloc: L558-1 1203#L558-2 SUMMARY for call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4); srcloc: L558-2 1205#L558-3 havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1209#L557-5 [2018-11-09 23:20:07,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 765917828, now seen corresponding path program 2 times [2018-11-09 23:20:07,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:07,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:20:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1742720554, now seen corresponding path program 2 times [2018-11-09 23:20:07,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:07,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:07,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:20:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1123128749, now seen corresponding path program 1 times [2018-11-09 23:20:07,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:20:07,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:20:07,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:20:07,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:20:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:20:07,889 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 150 [2018-11-09 23:20:08,032 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-09 23:20:08,035 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:20:08,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:20:08,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:20:08,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:20:08,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:20:08,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:20:08,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:20:08,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:20:08,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-09 23:20:08,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:20:08,035 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:20:08,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,379 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2018-11-09 23:20:08,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:20:08,803 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:20:08,803 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:20:08,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:20:08,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:20:08,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:20:08,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:20:08,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:20:08,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:20:08,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:20:08,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:20:08,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:20:08,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:20:08,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:20:08,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:20:08,860 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:20:08,860 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-09 23:20:08,860 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:20:08,861 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-09 23:20:08,861 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:20:08,861 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4 - 1 >= 0] [2018-11-09 23:20:08,988 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 23:20:08,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:08,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 23:20:09,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-09 23:20:09,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 23:20:09,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-09 23:20:09,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 23:20:09,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-09 23:20:09,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 23:20:09,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-09 23:20:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-11-09 23:20:09,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-09 23:20:09,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:50 [2018-11-09 23:20:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:09,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-09 23:20:09,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-09 23:20:09,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 82 states and 90 transitions. Complement of second has 18 states. [2018-11-09 23:20:09,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-09 23:20:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2018-11-09 23:20:09,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-09 23:20:09,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:09,258 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:20:09,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-09 23:20:09,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 23:20:09,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-09 23:20:09,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 23:20:09,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-09 23:20:09,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 23:20:09,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-09 23:20:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-11-09 23:20:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-09 23:20:09,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:50 [2018-11-09 23:20:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:09,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-09 23:20:09,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-09 23:20:09,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 81 states and 89 transitions. Complement of second has 20 states. [2018-11-09 23:20:09,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 4 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-09 23:20:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2018-11-09 23:20:09,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-09 23:20:09,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:09,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:20:09,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:20:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-09 23:20:09,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 23:20:09,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-09 23:20:09,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 23:20:09,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-09 23:20:09,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 23:20:09,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 23:20:09,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:20:09,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-09 23:20:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:20:09,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:20:09,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-11-09 23:20:09,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:20:09,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-09 23:20:09,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:20:09,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:50 [2018-11-09 23:20:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:20:09,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-09 23:20:09,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-09 23:20:09,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 73 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 97 states and 108 transitions. Complement of second has 17 states. [2018-11-09 23:20:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 23:20:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-09 23:20:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2018-11-09 23:20:09,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-09 23:20:09,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:09,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 38 letters. Loop has 8 letters. [2018-11-09 23:20:09,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:09,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 30 letters. Loop has 16 letters. [2018-11-09 23:20:09,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:20:09,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 108 transitions. [2018-11-09 23:20:09,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:20:09,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 0 states and 0 transitions. [2018-11-09 23:20:09,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:20:09,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:20:09,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:20:09,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:20:09,964 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:20:09,964 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:20:09,964 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:20:09,964 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 23:20:09,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:20:09,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:20:09,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 23:20:09,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:20:09 BoogieIcfgContainer [2018-11-09 23:20:09,968 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:20:09,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:20:09,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:20:09,969 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:20:09,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:00" (3/4) ... [2018-11-09 23:20:09,972 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 23:20:09,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:20:09,973 INFO L168 Benchmark]: Toolchain (without parser) took 10052.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 957.6 MB in the beginning and 1.3 GB in the end (delta: -311.3 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,973 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:20:09,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,974 INFO L168 Benchmark]: Boogie Preprocessor took 21.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,974 INFO L168 Benchmark]: RCFGBuilder took 274.32 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,975 INFO L168 Benchmark]: BuchiAutomizer took 9403.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -163.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:20:09,975 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:20:09,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 274.32 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9403.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -163.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 - 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 (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 12 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 1 and consists of 11 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 1 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.3s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 177 SDtfs, 322 SDslu, 174 SDs, 0 SdLazy, 505 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1043 mio100 ax103 hnf100 lsp94 ukn48 mio100 lsp35 div100 bol100 ite100 ukn100 eq195 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...