./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/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 faaae9aa069653e753b732f00a89bd7a139fa132 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:23:29,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:23:29,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:23:29,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:23:29,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:23:29,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:23:29,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:23:29,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:23:29,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:23:29,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:23:29,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:23:29,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:23:29,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:23:29,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:23:29,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:23:29,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:23:29,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:23:29,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:23:29,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:23:29,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:23:29,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:23:29,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:23:29,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:23:29,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:23:29,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:23:29,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:23:29,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:23:29,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:23:29,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:23:29,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:23:29,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:23:29,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:23:29,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:23:29,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:23:29,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:23:29,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:23:29,700 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:23:29,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:23:29,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:23:29,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:23:29,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:23:29,712 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:23:29,713 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:23:29,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:23:29,713 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:23:29,714 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:23:29,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:23:29,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:23:29,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:23:29,715 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:23:29,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:23:29,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:23:29,715 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:23:29,716 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:23:29,716 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_3d16305d-7f42-436e-b068-c1a5d42c1aa4/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2018-11-28 11:23:29,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:23:29,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:23:29,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:23:29,756 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:23:29,756 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:23:29,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-28 11:23:29,801 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/data/0c467c6d7/8d602c8c931d4279996f429d44831b43/FLAGa0ab0b1bd [2018-11-28 11:23:30,199 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:23:30,200 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-28 11:23:30,203 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/data/0c467c6d7/8d602c8c931d4279996f429d44831b43/FLAGa0ab0b1bd [2018-11-28 11:23:30,213 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/data/0c467c6d7/8d602c8c931d4279996f429d44831b43 [2018-11-28 11:23:30,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:23:30,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:23:30,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:30,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:23:30,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:23:30,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db12ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30, skipping insertion in model container [2018-11-28 11:23:30,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:23:30,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:23:30,332 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:30,338 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:23:30,349 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:30,359 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:23:30,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30 WrapperNode [2018-11-28 11:23:30,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:30,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:23:30,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:23:30,360 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:23:30,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:23:30,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:23:30,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:23:30,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:23:30,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... [2018-11-28 11:23:30,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:23:30,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:23:30,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:23:30,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:23:30,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/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-28 11:23:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:23:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-28 11:23:30,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-28 11:23:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:23:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:23:30,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:23:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:23:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:23:30,658 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:23:30,658 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:23:30,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:30 BoogieIcfgContainer [2018-11-28 11:23:30,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:23:30,659 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:23:30,659 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:23:30,663 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:23:30,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:30,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:30" (1/3) ... [2018-11-28 11:23:30,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae7bc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:30, skipping insertion in model container [2018-11-28 11:23:30,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:30,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:30" (2/3) ... [2018-11-28 11:23:30,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae7bc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:30, skipping insertion in model container [2018-11-28 11:23:30,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:30,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:30" (3/3) ... [2018-11-28 11:23:30,668 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-11-28 11:23:30,717 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:23:30,717 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:23:30,718 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:23:30,718 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:23:30,718 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:23:30,718 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:23:30,718 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:23:30,718 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:23:30,718 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:23:30,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:23:30,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:23:30,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:30,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:30,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:23:30,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:30,763 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:23:30,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:23:30,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:23:30,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:30,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:30,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:23:30,766 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:30,772 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L31-3true [2018-11-28 11:23:30,773 INFO L796 eck$LassoCheckResult]: Loop: 7#L31-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 18#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 12#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 15#recEXITtrue >#44#return; 6#L39-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 7#L31-3true [2018-11-28 11:23:30,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-28 11:23:30,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:30,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:30,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-28 11:23:30,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:30,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:31,030 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-28 11:23:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:31,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:23:31,036 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:23:31,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:23:31,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:23:31,046 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-28 11:23:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:31,112 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 11:23:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:23:31,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 11:23:31,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:23:31,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-28 11:23:31,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 11:23:31,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 11:23:31,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 11:23:31,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:23:31,127 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:23:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 11:23:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 11:23:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 11:23:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 11:23:31,153 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:23:31,153 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:23:31,153 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:23:31,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 11:23:31,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:23:31,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:31,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:31,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:23:31,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:31,155 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L31-3 [2018-11-28 11:23:31,155 INFO L796 eck$LassoCheckResult]: Loop: 57#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 61#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 63#recFINAL assume true; 65#recEXIT >#42#return; 59#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 60#recFINAL assume true; 66#recEXIT >#44#return; 55#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 57#L31-3 [2018-11-28 11:23:31,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-28 11:23:31,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-28 11:23:31,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:31,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:31,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-28 11:23:31,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:31,574 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 11:23:32,004 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2018-11-28 11:23:32,154 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:32,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:32,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:32,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:32,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:32,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:32,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:32,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:32,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration2_Lasso [2018-11-28 11:23:32,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:32,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:32,173 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-28 11:23:32,176 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-28 11:23:32,178 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-28 11:23:32,182 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-28 11:23:32,188 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-28 11:23:32,190 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-28 11:23:32,192 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-28 11:23:32,193 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-28 11:23:32,195 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-28 11:23:32,344 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-28 11:23:32,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:32,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:32,537 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-28 11:23:32,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:32,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,546 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-28 11:23:32,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,549 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-28 11:23:32,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:32,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:32,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:32,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,557 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-28 11:23:32,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:32,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:32,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:32,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,563 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-28 11:23:32,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,568 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-28 11:23:32,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:32,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:32,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:32,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:32,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:32,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:32,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:32,595 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-28 11:23:32,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:32,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:32,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:32,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:32,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:32,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:32,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:32,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:23:32,614 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:32,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:32,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:23:32,617 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:32,617 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-28 11:23:32,629 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 11:23:32,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:23:32,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:32,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:32,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:32,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:32,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:32,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-28 11:23:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,737 INFO L478 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 26 treesize of output 27 [2018-11-28 11:23:32,739 INFO L478 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-28 11:23:32,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-28 11:23:32,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-28 11:23:32,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-28 11:23:32,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:32,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-28 11:23:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:23:32,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 11:23:32,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 11:23:32,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-28 11:23:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:23:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-28 11:23:32,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-28 11:23:32,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:32,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 11:23:32,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:32,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-28 11:23:32,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:32,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-28 11:23:32,916 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 11:23:32,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-28 11:23:32,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-28 11:23:32,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 11:23:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-28 11:23:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:32,919 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 11:23:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-28 11:23:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-28 11:23:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 11:23:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-28 11:23:32,924 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 11:23:32,924 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 11:23:32,924 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:23:32,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-28 11:23:32,926 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 11:23:32,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:32,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:32,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:32,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:32,926 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 288#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 287#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 11:23:32,927 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 11:23:32,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-28 11:23:32,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:32,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-28 11:23:32,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:32,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:32,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-28 11:23:32,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:32,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:32,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:33,458 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-28 11:23:33,727 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-11-28 11:23:33,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:33,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:33,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:33,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:33,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:33,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:33,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:33,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:33,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:23:33,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:33,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:33,787 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-28 11:23:33,789 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-28 11:23:33,790 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-28 11:23:33,791 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-28 11:23:33,793 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-28 11:23:33,794 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-28 11:23:33,795 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-28 11:23:33,796 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-28 11:23:33,797 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-28 11:23:33,798 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-28 11:23:33,799 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-28 11:23:33,800 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-28 11:23:33,801 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-28 11:23:33,802 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-28 11:23:33,803 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-28 11:23:33,804 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-28 11:23:33,805 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-28 11:23:33,806 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-28 11:23:33,807 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-28 11:23:33,808 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-28 11:23:33,809 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-28 11:23:33,811 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-28 11:23:33,812 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-28 11:23:33,813 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-28 11:23:33,815 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-28 11:23:33,815 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-28 11:23:33,816 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-28 11:23:33,817 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-28 11:23:33,818 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-28 11:23:33,820 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-28 11:23:33,821 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-28 11:23:33,822 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-28 11:23:33,823 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-28 11:23:33,825 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-28 11:23:33,826 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-28 11:23:34,135 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:34,135 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:34,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:34,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,138 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-28 11:23:34,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,140 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-28 11:23:34,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,142 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-28 11:23:34,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,144 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-28 11:23:34,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,145 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-28 11:23:34,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,147 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-28 11:23:34,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,149 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-28 11:23:34,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,150 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-28 11:23:34,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,152 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-28 11:23:34,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,154 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-28 11:23:34,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:34,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:34,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:34,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,159 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-28 11:23:34,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,161 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-28 11:23:34,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,162 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-28 11:23:34,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,164 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-28 11:23:34,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,166 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-28 11:23:34,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,168 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-28 11:23:34,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,170 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-28 11:23:34,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,171 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-28 11:23:34,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,173 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-28 11:23:34,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:34,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:34,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,176 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-28 11:23:34,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,178 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-28 11:23:34,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,180 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-28 11:23:34,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,181 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-28 11:23:34,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,183 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-28 11:23:34,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,185 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-28 11:23:34,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,187 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-28 11:23:34,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,189 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-28 11:23:34,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,190 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-28 11:23:34,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,192 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-28 11:23:34,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,194 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-28 11:23:34,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,196 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-28 11:23:34,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,198 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-28 11:23:34,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:34,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:34,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:34,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,199 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-28 11:23:34,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:34,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:34,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,206 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-28 11:23:34,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:34,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:34,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,209 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-28 11:23:34,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,209 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:23:34,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:23:34,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,211 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 11:23:34,211 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 11:23:34,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:34,219 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-28 11:23:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:34,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:34,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:34,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:34,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:34,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:34,242 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:34,254 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:34,254 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:23:34,255 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:34,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:23:34,256 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:34,256 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-28 11:23:34,285 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 11:23:34,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:23:34,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:34,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:34,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:34,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 11:23:34,383 INFO L478 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 37 treesize of output 36 [2018-11-28 11:23:34,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,409 INFO L478 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 11:23:34,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:34,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 11:23:34,462 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-28 11:23:34,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:23:34,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 11:23:34,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-28 11:23:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 11:23:34,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 11:23:34,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:34,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 11:23:34,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:34,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:23:34,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:34,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-28 11:23:34,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 11:23:34,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-28 11:23:34,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-28 11:23:34,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-28 11:23:34,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-28 11:23:34,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:34,518 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-28 11:23:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-28 11:23:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-28 11:23:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 11:23:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-28 11:23:34,525 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 11:23:34,525 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 11:23:34,525 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:23:34,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-28 11:23:34,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 11:23:34,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:34,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:34,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:34,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:34,528 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 481#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 483#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 500#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 547#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 471#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 470#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 473#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 502#recFINAL assume true; 510#recEXIT >#42#return; 523#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 521#recFINAL assume true; 518#recEXIT >#44#return; 477#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 478#L39-3 [2018-11-28 11:23:34,528 INFO L796 eck$LassoCheckResult]: Loop: 478#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 513#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 524#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 522#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 498#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 528#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 534#recFINAL assume true; 541#recEXIT >#42#return; 529#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 530#recFINAL assume true; 527#recEXIT >#44#return; 517#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 478#L39-3 [2018-11-28 11:23:34,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-28 11:23:34,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:34,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:34,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:34,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:34,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d16305d-7f42-436e-b068-c1a5d42c1aa4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:34,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:34,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:34,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 11:23:34,692 INFO L478 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 26 treesize of output 25 [2018-11-28 11:23:34,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,714 INFO L478 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 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 11:23:34,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:34,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-28 11:23:34,780 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:23:34,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 17 treesize of output 13 [2018-11-28 11:23:34,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-11-28 11:23:34,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-28 11:23:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:34,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:34,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 11:23:34,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:23:34,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-28 11:23:34,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:34,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,125 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 11:23:35,530 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-28 11:23:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:23:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:23:35,582 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-28 11:23:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:35,650 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-28 11:23:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:23:35,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-28 11:23:35,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:23:35,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-28 11:23:35,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:23:35,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:23:35,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-28 11:23:35,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:35,654 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-28 11:23:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-28 11:23:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-28 11:23:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 11:23:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-28 11:23:35,658 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 11:23:35,658 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 11:23:35,658 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:23:35,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-28 11:23:35,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:23:35,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:35,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:35,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:35,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:35,659 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 716#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 717#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 749#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 725#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 726#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 722#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 745#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 729#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 730#recFINAL assume true; 750#recEXIT >#42#return; 738#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 737#recFINAL assume true; 736#recEXIT >#44#return; 714#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 715#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 718#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 720#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 727#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 709#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2018-11-28 11:23:35,659 INFO L796 eck$LassoCheckResult]: Loop: 706#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 708#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2018-11-28 11:23:35,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-28 11:23:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:35,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:35,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-28 11:23:35,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-28 11:23:35,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:36,246 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 11:23:37,326 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 194 [2018-11-28 11:23:37,566 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-28 11:23:37,833 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-28 11:23:37,958 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-28 11:23:37,959 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:37,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:37,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:37,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:37,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:37,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:37,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:37,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:37,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:23:37,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:37,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:37,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-28 11:23:37,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-28 11:23:37,966 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-28 11:23:37,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-28 11:23:37,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-28 11:23:37,978 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-28 11:23:37,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-28 11:23:37,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,985 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-28 11:23:37,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,989 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-28 11:23:37,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,991 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-28 11:23:37,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:37,994 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-28 11:23:38,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,100 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-28 11:23:38,101 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-28 11:23:38,102 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-28 11:23:38,103 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-28 11:23:38,104 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-28 11:23:38,105 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-28 11:23:38,106 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-28 11:23:38,107 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-28 11:23:38,107 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-28 11:23:38,108 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-28 11:23:38,109 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-28 11:23:38,110 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-28 11:23:38,111 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-28 11:23:38,111 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-28 11:23:38,112 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-28 11:23:38,113 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-28 11:23:38,114 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-28 11:23:38,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:38,263 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:38,263 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-28 11:23:38,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,265 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-28 11:23:38,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:38,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:38,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:38,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,274 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-28 11:23:38,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,277 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-28 11:23:38,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,279 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-28 11:23:38,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,281 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-28 11:23:38,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,282 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-28 11:23:38,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,285 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-28 11:23:38,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,286 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-28 11:23:38,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,288 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-28 11:23:38,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,289 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-28 11:23:38,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:38,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,292 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-28 11:23:38,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,294 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-28 11:23:38,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,298 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-28 11:23:38,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,302 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-28 11:23:38,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:38,304 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-28 11:23:38,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:23:38,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:23:38,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:38,311 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:23:38,311 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:23:38,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:38,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:23:38,312 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:38,312 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-28 11:23:38,344 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 11:23:38,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:23:38,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 11:23:38,431 INFO L478 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 37 treesize of output 36 [2018-11-28 11:23:38,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,457 INFO L478 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 11:23:38,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:38,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 11:23:38,496 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-28 11:23:38,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 11:23:38,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 11:23:38,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-28 11:23:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 11:23:38,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 11:23:38,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:38,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 11:23:38,612 INFO L478 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 37 treesize of output 36 [2018-11-28 11:23:38,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,640 INFO L478 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 11:23:38,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:38,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 11:23:38,685 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-28 11:23:38,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 11:23:38,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 11:23:38,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-28 11:23:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 11:23:38,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 11:23:38,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,735 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:38,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 11:23:38,828 INFO L478 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 37 treesize of output 36 [2018-11-28 11:23:38,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,859 INFO L478 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 11:23:38,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:38,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 11:23:38,899 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-28 11:23:38,900 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 11:23:38,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 11:23:38,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2018-11-28 11:23:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 11:23:38,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 11:23:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-28 11:23:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 11:23:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-28 11:23:38,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:23:38,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:23:38,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:23:38,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:23:38,955 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:23:38,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:23:38,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:23:38,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:23:38,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:23:38 BoogieIcfgContainer [2018-11-28 11:23:38,961 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:23:38,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:23:38,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:23:38,961 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:23:38,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:30" (3/4) ... [2018-11-28 11:23:38,964 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:23:38,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:23:38,965 INFO L168 Benchmark]: Toolchain (without parser) took 8749.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 953.3 MB in the beginning and 1.3 GB in the end (delta: -369.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:38,965 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:38,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.90 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:38,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.00 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:38,966 INFO L168 Benchmark]: Boogie Preprocessor took 54.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:38,967 INFO L168 Benchmark]: RCFGBuilder took 214.26 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:38,967 INFO L168 Benchmark]: BuchiAutomizer took 8302.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:38,967 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:38,969 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.90 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.00 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.26 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8302.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 58 SDslu, 139 SDs, 0 SdLazy, 251 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp27 div100 bol100 ite100 ukn100 eq192 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...