./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex4_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex4_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 531407ed3b7c40d8a6107454133dd490b91ef528 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:06:10,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:06:10,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:06:10,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:06:10,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:06:10,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:06:10,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:06:10,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:06:10,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:06:10,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:06:10,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:06:10,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:06:10,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:06:10,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:06:10,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:06:10,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:06:10,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:06:10,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:06:10,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:06:10,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:06:10,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:06:10,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:06:10,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:06:10,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:06:10,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:06:10,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:06:10,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:06:10,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:06:10,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:06:10,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:06:10,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:06:10,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:06:10,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:06:10,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:06:10,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:06:10,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:06:10,422 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:06:10,449 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:06:10,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:06:10,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:06:10,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:06:10,455 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:06:10,455 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:06:10,456 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:06:10,457 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:06:10,457 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:06:10,457 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:06:10,457 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:06:10,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:06:10,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:06:10,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:06:10,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:06:10,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:06:10,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:06:10,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:06:10,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:06:10,459 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:06:10,459 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:06:10,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:06:10,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:06:10,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:06:10,462 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:06:10,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:06:10,463 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:06:10,463 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:06:10,464 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:06:10,464 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 531407ed3b7c40d8a6107454133dd490b91ef528 [2019-01-01 22:06:10,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:06:10,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:06:10,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:06:10,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:06:10,539 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:06:10,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex4_true-termination.c.i [2019-01-01 22:06:10,608 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da807bb9f/ccb13f774abb495fa3e7fb594753d54c/FLAG6fa36cdd9 [2019-01-01 22:06:11,018 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:06:11,019 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex4_true-termination.c.i [2019-01-01 22:06:11,025 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da807bb9f/ccb13f774abb495fa3e7fb594753d54c/FLAG6fa36cdd9 [2019-01-01 22:06:11,402 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da807bb9f/ccb13f774abb495fa3e7fb594753d54c [2019-01-01 22:06:11,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:06:11,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:06:11,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:11,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:06:11,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:06:11,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd325c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11, skipping insertion in model container [2019-01-01 22:06:11,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:06:11,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:06:11,618 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:11,637 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:06:11,659 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:11,683 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:06:11,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11 WrapperNode [2019-01-01 22:06:11,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:11,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:11,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:06:11,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:06:11,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:11,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:06:11,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:06:11,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:06:11,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... [2019-01-01 22:06:11,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:06:11,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:06:11,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:06:11,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:06:11,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:06:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:06:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 22:06:11,917 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 22:06:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 22:06:11,918 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 22:06:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:06:11,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:06:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:06:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:06:12,343 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:06:12,343 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 22:06:12,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:12 BoogieIcfgContainer [2019-01-01 22:06:12,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:06:12,346 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:06:12,346 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:06:12,351 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:06:12,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:12,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:06:11" (1/3) ... [2019-01-01 22:06:12,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08cb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:12, skipping insertion in model container [2019-01-01 22:06:12,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:12,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:11" (2/3) ... [2019-01-01 22:06:12,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08cb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:12, skipping insertion in model container [2019-01-01 22:06:12,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:12,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:12" (3/3) ... [2019-01-01 22:06:12,357 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex4_true-termination.c.i [2019-01-01 22:06:12,412 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:06:12,413 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:06:12,413 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:06:12,414 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:06:12,414 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:06:12,414 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:06:12,414 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:06:12,414 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:06:12,414 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:06:12,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-01 22:06:12,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 22:06:12,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:12,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:12,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:06:12,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:06:12,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:06:12,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-01 22:06:12,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 22:06:12,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:12,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:12,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:06:12,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:06:12,484 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(main_#t~nondet11, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet12; 6#L50true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-01-01 22:06:12,484 INFO L796 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem1;havoc #t~mem2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 18#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);call #t~mem6 := read~int(~q.base, ~q.offset, 4); 7#L31true assume !(#t~mem5 + #t~mem6 < 0);havoc #t~mem6;havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 16#L36true call f(~p.base, ~p.offset, ~q.base, ~q.offset);< 13#fENTRYtrue [2019-01-01 22:06:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash 43766, now seen corresponding path program 1 times [2019-01-01 22:06:12,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:12,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 891830467, now seen corresponding path program 1 times [2019-01-01 22:06:12,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1193795592, now seen corresponding path program 1 times [2019-01-01 22:06:12,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:13,184 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:06:13,387 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 22:06:13,703 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 22:06:13,984 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 22:06:14,715 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-01-01 22:06:14,851 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 22:06:14,990 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 22:06:15,546 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-01-01 22:06:15,980 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-01 22:06:16,145 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 22:06:16,270 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 22:06:16,373 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:16,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:16,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:16,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:16,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:16,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:16,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:16,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:16,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex4_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:06:16,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:16,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:16,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,689 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 22:06:16,990 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-01 22:06:16,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:17,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:17,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:17,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:17,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:17,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:17,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:17,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:17,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:17,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:17,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:17,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:17,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:17,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:17,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:17,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:17,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:17,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:17,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:17,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:17,820 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:06:17,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:17,824 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:17,825 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:17,825 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1 + 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2019-01-01 22:06:17,851 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:06:17,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:17,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:18,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:18,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:18,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:18,073 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 [2019-01-01 22:06:18,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:18,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 56 [2019-01-01 22:06:18,163 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 49 treesize of output 48 [2019-01-01 22:06:18,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:18,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:18,254 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 38 treesize of output 48 [2019-01-01 22:06:18,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:18,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:18,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 22:06:18,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:78 [2019-01-01 22:06:18,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:18,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-01 22:06:18,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:18,776 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 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-01 22:06:18,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:18,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:18,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:18,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-01-01 22:06:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:18,832 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 [2019-01-01 22:06:18,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 7 states. [2019-01-01 22:06:19,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 7 states. Result 46 states and 52 transitions. Complement of second has 22 states. [2019-01-01 22:06:19,107 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 [2019-01-01 22:06:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 22:06:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-01-01 22:06:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 22:06:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:06:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-01 22:06:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2019-01-01 22:06:19,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:19,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-01 22:06:19,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:06:19,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:06:19,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:06:19,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:19,125 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:19,125 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:19,125 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:19,125 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:06:19,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:06:19,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:19,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:06:19,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:06:19 BoogieIcfgContainer [2019-01-01 22:06:19,133 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:06:19,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:06:19,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:06:19,133 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:06:19,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:12" (3/4) ... [2019-01-01 22:06:19,138 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:06:19,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:06:19,139 INFO L168 Benchmark]: Toolchain (without parser) took 7732.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 946.0 MB in the beginning and 982.8 MB in the end (delta: -36.9 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:19,140 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:19,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.91 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:19,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.31 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:19,142 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:19,143 INFO L168 Benchmark]: RCFGBuilder took 568.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:19,144 INFO L168 Benchmark]: BuchiAutomizer took 6786.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 982.8 MB in the end (delta: 130.4 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:19,145 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.2 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:19,151 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.91 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 55.31 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 568.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6786.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 982.8 MB in the end (delta: 130.4 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.2 GB. Free memory is still 982.8 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] + unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 22 SDs, 0 SdLazy, 76 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital296 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp38 div100 bol100 ite100 ukn100 eq161 hnf90 smp96 dnf108 smp93 tf100 neg98 sie132 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...