./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/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_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/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-635dfa2 [2018-12-09 01:19:36,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:19:36,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:19:36,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:19:36,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:19:36,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:19:36,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:19:36,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:19:36,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:19:36,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:19:36,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:19:36,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:19:36,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:19:36,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:19:36,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:19:36,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:19:36,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:19:36,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:19:36,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:19:36,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:19:36,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:19:36,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:19:36,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:19:36,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:19:36,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:19:36,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:19:36,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:19:36,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:19:36,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:19:36,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:19:36,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:19:36,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:19:36,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:19:36,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:19:36,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:19:36,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:19:36,498 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 01:19:36,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:19:36,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:19:36,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:19:36,507 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:19:36,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:19:36,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:19:36,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:19:36,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:19:36,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:19:36,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:19:36,509 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:19:36,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:19:36,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:19:36,509 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:19:36,510 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:19:36,510 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_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/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-12-09 01:19:36,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:19:36,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:19:36,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:19:36,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:19:36,539 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:19:36,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-12-09 01:19:36,577 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/data/b9a3c08d7/e99b19ad3f604ff98ac8259989cf0ac8/FLAGbd6a1d98b [2018-12-09 01:19:36,991 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:19:36,992 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-12-09 01:19:36,995 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/data/b9a3c08d7/e99b19ad3f604ff98ac8259989cf0ac8/FLAGbd6a1d98b [2018-12-09 01:19:37,003 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/bin-2019/uautomizer/data/b9a3c08d7/e99b19ad3f604ff98ac8259989cf0ac8 [2018-12-09 01:19:37,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:19:37,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:19:37,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:37,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:19:37,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:19:37,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f56f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37, skipping insertion in model container [2018-12-09 01:19:37,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:19:37,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:19:37,106 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:37,112 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:19:37,121 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:37,130 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:19:37,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37 WrapperNode [2018-12-09 01:19:37,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:37,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:37,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:19:37,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:19:37,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:37,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:19:37,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:19:37,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:19:37,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... [2018-12-09 01:19:37,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:19:37,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:19:37,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:19:37,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:19:37,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/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-12-09 01:19:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:19:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-09 01:19:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-09 01:19:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:19:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:19:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:19:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:19:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:19:37,336 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:19:37,336 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 01:19:37,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:37 BoogieIcfgContainer [2018-12-09 01:19:37,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:19:37,337 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:19:37,337 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:19:37,339 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:19:37,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:37,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:19:37" (1/3) ... [2018-12-09 01:19:37,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19b2d4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:19:37, skipping insertion in model container [2018-12-09 01:19:37,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:37,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:37" (2/3) ... [2018-12-09 01:19:37,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19b2d4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:19:37, skipping insertion in model container [2018-12-09 01:19:37,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:37,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:37" (3/3) ... [2018-12-09 01:19:37,342 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-12-09 01:19:37,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:19:37,373 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:19:37,373 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:19:37,373 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:19:37,373 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:19:37,373 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:19:37,373 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:19:37,373 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:19:37,373 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:19:37,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 01:19:37,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 01:19:37,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:37,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:37,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:19:37,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:37,400 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:19:37,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 01:19:37,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 01:19:37,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:37,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:37,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:19:37,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:37,407 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-12-09 01:19:37,407 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~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 7#L31-3true [2018-12-09 01:19:37,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-09 01:19:37,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:37,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:37,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:37,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-12-09 01:19:37,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:37,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:37,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:37,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:37,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:37,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:19:37,582 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:19:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:19:37,593 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-12-09 01:19:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:37,647 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-09 01:19:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:19:37,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-09 01:19:37,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 01:19:37,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-12-09 01:19:37,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 01:19:37,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 01:19:37,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-09 01:19:37,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:37,657 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 01:19:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-09 01:19:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 01:19:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 01:19:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-09 01:19:37,675 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 01:19:37,676 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 01:19:37,676 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:19:37,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-09 01:19:37,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 01:19:37,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:37,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:37,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:19:37,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:37,677 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-12-09 01:19:37,677 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~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 57#L31-3 [2018-12-09 01:19:37,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-12-09 01:19:37,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-12-09 01:19:37,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-12-09 01:19:37,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:37,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:37,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:37,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:37,993 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-12-09 01:19:38,392 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2018-12-09 01:19:38,532 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:19:38,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:19:38,533 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:19:38,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:19:38,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:19:38,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:19:38,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:19:38,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:19:38,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration2_Lasso [2018-12-09 01:19:38,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:19:38,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:19:38,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:38,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:19:38,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:19:38,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:19:38,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:19:38,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:38,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:38,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:19:38,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:38,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:38,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:19:38,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:38,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:38,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:38,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:38,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:38,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:38,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:38,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:38,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:38,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:38,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:38,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:38,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:38,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:19:38,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:19:38,920 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 01:19:38,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:19:38,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:19:38,923 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:19:38,923 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-12-09 01:19:38,929 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 01:19:38,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:19:38,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:38,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:38,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:39,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:39,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:39,015 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-12-09 01:19:39,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,028 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-12-09 01:19:39,030 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-12-09 01:19:39,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,049 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-12-09 01:19:39,049 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-12-09 01:19:39,057 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-12-09 01:19:39,059 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-12-09 01:19:39,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:39,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-12-09 01:19:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:19:39,095 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-12-09 01:19:39,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-12-09 01:19:39,172 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-12-09 01:19:39,172 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-12-09 01:19:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 01:19:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-12-09 01:19:39,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-09 01:19:39,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:39,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-12-09 01:19:39,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:39,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-12-09 01:19:39,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:39,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-12-09 01:19:39,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-09 01:19:39,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-12-09 01:19:39,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-09 01:19:39,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-09 01:19:39,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-12-09 01:19:39,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:19:39,180 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-09 01:19:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-12-09 01:19:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-12-09 01:19:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 01:19:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-12-09 01:19:39,184 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-12-09 01:19:39,184 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-12-09 01:19:39,184 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:19:39,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-12-09 01:19:39,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-09 01:19:39,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:39,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:39,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:39,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:19:39,185 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-12-09 01:19:39,186 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-12-09 01:19:39,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-12-09 01:19:39,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:39,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:39,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:39,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-12-09 01:19:39,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-12-09 01:19:39,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:39,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:39,634 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-12-09 01:19:39,914 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-12-09 01:19:39,984 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:19:39,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:19:39,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:19:39,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:19:39,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:19:39,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:19:39,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:19:39,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:19:39,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-12-09 01:19:39,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:19:39,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:19:39,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-12-09 01:19:39,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-12-09 01:19:39,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:39,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-12-09 01:19:39,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:39,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:39,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:39,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:39,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:40,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:19:40,282 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:19:40,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:19:40,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:40,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:40,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,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-12-09 01:19:40,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:40,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:40,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:40,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:40,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:40,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:40,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:40,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:40,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:40,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,342 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:19:40,343 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:19:40,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,344 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 01:19:40,344 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 01:19:40,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:40,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:40,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:40,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:40,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:40,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:40,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:40,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:40,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:19:40,383 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 01:19:40,383 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 01:19:40,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:19:40,384 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:19:40,385 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:19:40,385 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-12-09 01:19:40,392 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 01:19:40,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:19:40,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:40,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:40,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:40,475 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-12-09 01:19:40,479 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-12-09 01:19:40,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:40,510 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-12-09 01:19:40,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:40,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:40,538 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-12-09 01:19:40,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-09 01:19:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:40,557 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-12-09 01:19:40,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-09 01:19:40,616 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-12-09 01:19:40,617 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-12-09 01:19:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 01:19:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-09 01:19:40,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 01:19:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:40,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-09 01:19:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:40,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-09 01:19:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:40,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-12-09 01:19:40,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-09 01:19:40,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-12-09 01:19:40,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-09 01:19:40,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-12-09 01:19:40,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-12-09 01:19:40,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:19:40,624 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-12-09 01:19:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-12-09 01:19:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-12-09 01:19:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 01:19:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-12-09 01:19:40,631 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-12-09 01:19:40,631 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-12-09 01:19:40,631 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:19:40,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-12-09 01:19:40,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-09 01:19:40,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:40,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:40,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:40,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:40,634 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-12-09 01:19:40,634 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~ite13;havoc main_#t~ret12;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-12-09 01:19:40,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-12-09 01:19:40,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:40,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:40,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:19:40,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7d7eacc-cbe0-46d4-b67a-a5c9315ec414/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-12-09 01:19:40,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:40,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:40,763 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-12-09 01:19:40,765 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-12-09 01:19:40,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:40,789 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-12-09 01:19:40,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:40,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:40,809 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-12-09 01:19:40,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-12-09 01:19:40,844 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:19:40,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,849 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-12-09 01:19:40,850 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-12-09 01:19:40,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-12-09 01:19:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:19:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-09 01:19:40,885 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:19:40,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-12-09 01:19:40,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:40,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:40,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,106 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-12-09 01:19:41,417 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-12-09 01:19:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:19:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:19:41,471 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-12-09 01:19:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:41,549 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-12-09 01:19:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:19:41,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-12-09 01:19:41,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 01:19:41,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-12-09 01:19:41,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 01:19:41,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 01:19:41,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-12-09 01:19:41,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:19:41,553 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-12-09 01:19:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-12-09 01:19:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-09 01:19:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 01:19:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-09 01:19:41,558 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-09 01:19:41,558 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-09 01:19:41,558 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:19:41,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-12-09 01:19:41,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 01:19:41,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:41,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:41,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:41,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:19:41,560 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~ite13;havoc main_#t~ret12;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-12-09 01:19:41,560 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-12-09 01:19:41,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-12-09 01:19:41,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:41,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:41,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:41,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-12-09 01:19:41,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:41,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-12-09 01:19:41,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:41,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:41,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:41,946 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-12-09 01:19:43,061 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 194 [2018-12-09 01:19:43,299 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-12-09 01:19:43,578 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-12-09 01:19:43,719 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-12-09 01:19:43,721 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:19:43,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:19:43,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:19:43,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:19:43,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:19:43,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:19:43,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:19:43,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:19:43,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-12-09 01:19:43,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:19:43,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:19:43,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:43,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:19:44,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:19:44,024 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:19:44,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:19:44,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:19:44,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:19:44,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:19:44,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-09 01:19:44,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:19:44,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:19:44,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:19:44,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:19:44,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:19:44,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:19:44,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:19:44,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:19:44,065 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 01:19:44,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:19:44,066 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:19:44,066 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:19:44,066 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-12-09 01:19:44,068 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 01:19:44,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:19:44,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,155 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-12-09 01:19:44,157 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-12-09 01:19:44,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:44,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:44,180 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-12-09 01:19:44,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,201 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-12-09 01:19:44,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-09 01:19:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:44,216 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-12-09 01:19:44,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 01:19:44,251 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-12-09 01:19:44,251 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-12-09 01:19:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 01:19:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-09 01:19:44,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-09 01:19:44,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:44,252 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 01:19:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,314 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-12-09 01:19:44,316 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-12-09 01:19:44,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:44,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:44,340 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-12-09 01:19:44,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,362 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-12-09 01:19:44,363 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-09 01:19:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:44,379 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-12-09 01:19:44,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 01:19:44,414 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-12-09 01:19:44,414 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-12-09 01:19:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 01:19:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-09 01:19:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-09 01:19:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:44,415 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 01:19:44,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:44,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:44,482 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-12-09 01:19:44,485 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-12-09 01:19:44,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:44,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:44,508 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-12-09 01:19:44,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:44,529 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-12-09 01:19:44,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-09 01:19:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:44,543 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-12-09 01:19:44,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 01:19:44,592 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-12-09 01:19:44,592 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-12-09 01:19:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 01:19:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-12-09 01:19:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-09 01:19:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-12-09 01:19:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-09 01:19:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:19:44,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-09 01:19:44,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:19:44,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-12-09 01:19:44,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 01:19:44,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 01:19:44,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 01:19:44,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:44,595 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:19:44,595 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:19:44,595 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:19:44,595 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:19:44,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:19:44,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:19:44,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 01:19:44,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:19:44 BoogieIcfgContainer [2018-12-09 01:19:44,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:19:44,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:19:44,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:19:44,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:19:44,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:37" (3/4) ... [2018-12-09 01:19:44,601 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:19:44,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:19:44,602 INFO L168 Benchmark]: Toolchain (without parser) took 7596.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 954.4 MB in the beginning and 984.2 MB in the end (delta: -29.9 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:44,602 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-12-09 01:19:44,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.74 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:44,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.16 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:44,603 INFO L168 Benchmark]: Boogie Preprocessor took 43.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:44,603 INFO L168 Benchmark]: RCFGBuilder took 143.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:44,603 INFO L168 Benchmark]: BuchiAutomizer took 7261.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 103.6 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:44,604 INFO L168 Benchmark]: Witness Printer took 2.46 ms. Allocated memory is still 1.2 GB. Free memory is still 984.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:44,605 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 123.74 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.16 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7261.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 103.6 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.46 ms. Allocated memory is still 1.2 GB. Free memory is still 984.2 MB. 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 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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...