./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_ex11_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 2e31c843d33c80f978b3ed5615692b93565f0ae0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:16,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:16,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:16,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:16,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:16,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:16,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:16,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:16,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:16,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:16,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:16,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:16,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:16,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:16,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:16,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:16,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:16,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:16,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:16,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:16,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:16,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:16,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:16,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:16,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:16,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:16,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:16,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:16,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:16,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:16,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:16,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:16,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:16,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:16,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:16,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:16,596 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:16,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:16,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:16,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:16,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:16,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:16,630 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:16,631 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:16,633 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:16,633 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:16,633 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:16,633 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:16,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:16,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:16,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:16,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:16,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:16,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:16,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:16,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:16,635 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:16,635 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:16,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:16,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:16,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:16,638 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:16,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:16,639 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:16,639 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:16,640 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:16,640 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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2018-11-28 23:24:16,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:16,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:16,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:16,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:16,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:16,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-11-28 23:24:16,760 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efc98a67/00a72ea4adfb48f1a16eac0431472816/FLAGff9ea4c86 [2018-11-28 23:24:17,203 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:17,204 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-11-28 23:24:17,213 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efc98a67/00a72ea4adfb48f1a16eac0431472816/FLAGff9ea4c86 [2018-11-28 23:24:17,528 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efc98a67/00a72ea4adfb48f1a16eac0431472816 [2018-11-28 23:24:17,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:17,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:17,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:17,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:17,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:17,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a762d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17, skipping insertion in model container [2018-11-28 23:24:17,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:17,576 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:17,786 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:17,801 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:17,821 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:17,835 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:17,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17 WrapperNode [2018-11-28 23:24:17,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:17,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:17,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:17,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:17,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:17,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:17,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:17,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:17,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (1/1) ... [2018-11-28 23:24:17,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:17,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:17,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:17,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:17,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (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 [2018-11-28 23:24:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-28 23:24:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-28 23:24:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:18,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:18,421 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:24:18,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:18 BoogieIcfgContainer [2018-11-28 23:24:18,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:18,423 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:18,423 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:18,428 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:18,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:18,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:17" (1/3) ... [2018-11-28 23:24:18,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fd70c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:18, skipping insertion in model container [2018-11-28 23:24:18,430 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:18,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:17" (2/3) ... [2018-11-28 23:24:18,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fd70c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:18, skipping insertion in model container [2018-11-28 23:24:18,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:18,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:18" (3/3) ... [2018-11-28 23:24:18,434 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11_true-termination.c.i [2018-11-28 23:24:18,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:18,494 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:18,494 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:18,494 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:18,494 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:18,494 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:18,494 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:18,494 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:18,495 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:18,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:18,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:18,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:18,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:18,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:18,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:18,557 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:18,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:18,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:18,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:18,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:18,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:18,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:18,570 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 19#L28-3true [2018-11-28 23:24:18,570 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.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); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true 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); 6#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; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 19#L28-3true [2018-11-28 23:24:18,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-28 23:24:18,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:18,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:18,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:18,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:18,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-28 23:24:18,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:18,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:19,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:19,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:24:19,215 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:24:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:24:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:24:19,233 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-28 23:24:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:19,617 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 23:24:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:19,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 23:24:19,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:19,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-28 23:24:19,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:24:19,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:24:19,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:24:19,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:19,634 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:24:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:24:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:24:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:24:19,668 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:19,668 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:19,668 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:19,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 23:24:19,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:19,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:19,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:19,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:19,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:19,672 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#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; 58#L28-3 [2018-11-28 23:24:19,672 INFO L796 eck$LassoCheckResult]: Loop: 58#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 55#L28-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); 56#L32 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#L36 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;call ULTIMATE.dealloc(~op.base, ~op.offset); 53#L19 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; 59#recFINAL assume true; 64#recEXIT >#42#return; 61#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 66#recEXIT >#44#return; 65#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 63#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 58#L28-3 [2018-11-28 23:24:19,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-28 23:24:19,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-28 23:24:19,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-28 23:24:19,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:19,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,321 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:24:21,035 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-11-28 23:24:21,329 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 23:24:21,470 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-28 23:24:22,116 WARN L180 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2018-11-28 23:24:22,249 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-28 23:24:22,375 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:22,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:22,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:22,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:22,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:22,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:22,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:22,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:22,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:24:22,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:22,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:22,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,854 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-28 23:24:22,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-11-28 23:24:22,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,325 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:23,331 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:23,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:23,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:23,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:23,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:23,397 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:23,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:23,405 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:23,408 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:23,410 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:23,410 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:23,411 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-28 23:24:23,438 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:23,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:23,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:23,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:23,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:23,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:23,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:24:23,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 23:24:23,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:24:23,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,680 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-28 23:24:23,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 23:24:23,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-28 23:24:23,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-28 23:24:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:23,813 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:24:23,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 23:24:24,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-28 23:24:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-28 23:24:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-28 23:24:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 23:24:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-28 23:24:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:24,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-28 23:24:24,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:24,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-28 23:24:24,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-28 23:24:24,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 23:24:24,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-28 23:24:24,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:24,144 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 23:24:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-28 23:24:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-28 23:24:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:24:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-28 23:24:24,152 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:24,152 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:24,152 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:24,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-28 23:24:24,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:24,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:24,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:24,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:24,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:24,156 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#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; 250#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 245#L28-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); 246#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 256#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 274#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 285#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:24,156 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;call ULTIMATE.dealloc(~op.base, ~op.offset); 239#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-28 23:24:24,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-28 23:24:24,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:24,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:24,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:24,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-28 23:24:24,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:24,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,538 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-28 23:24:24,892 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-11-28 23:24:25,304 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-28 23:24:25,782 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2018-11-28 23:24:25,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:25,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:25,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:25,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:25,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:25,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:25,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:25,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:25,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:24:25,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:25,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:25,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,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-11-28 23:24:25,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,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-11-28 23:24:26,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,194 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-11-28 23:24:26,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:26,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:26,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 [2018-11-28 23:24:26,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,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 [2018-11-28 23:24:26,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,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 [2018-11-28 23:24:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:26,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:26,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,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 [2018-11-28 23:24:26,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:26,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:26,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:26,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:26,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:26,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:26,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:26,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,828 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:26,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:26,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,831 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:24:26,831 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:26,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:26,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:26,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:26,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:26,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:26,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:26,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:26,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:26,875 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:26,906 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:24:26,906 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:24:26,907 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:26,908 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:26,908 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:26,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 + 1 Supporting invariants [] [2018-11-28 23:24:26,997 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:24:27,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:27,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:27,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:27,306 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 23:24:27,332 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 52 treesize of output 44 [2018-11-28 23:24:27,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:27,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:27,394 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 30 treesize of output 32 [2018-11-28 23:24:27,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:27,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:27,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-28 23:24:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:27,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:24:27,504 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 23:24:27,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 99 states and 122 transitions. Complement of second has 18 states. [2018-11-28 23:24:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-28 23:24:27,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:24:27,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:27,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:24:27,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:27,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:24:27,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:27,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-28 23:24:27,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:27,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-28 23:24:27,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-28 23:24:27,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-28 23:24:27,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-28 23:24:27,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:27,711 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-28 23:24:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-28 23:24:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-28 23:24:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:24:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-28 23:24:27,722 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:27,722 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:27,722 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:27,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-28 23:24:27,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:27,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:27,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:27,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:27,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:27,726 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#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; 491#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 517#L28-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); 557#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 529#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 555#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 554#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 479#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 478#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 481#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; 489#recFINAL assume true; 512#recEXIT >#42#return; 538#L19-1 #res := #t~ret5;havoc #t~ret5; 537#recFINAL assume true; 528#recEXIT >#44#return; 515#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 506#L36-3 [2018-11-28 23:24:27,727 INFO L796 eck$LassoCheckResult]: Loop: 506#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 507#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 539#L28-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); 534#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L36 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); 544#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 532#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 544#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; 545#recFINAL assume true; 543#recEXIT >#42#return; 533#L19-1 #res := #t~ret5;havoc #t~ret5; 541#recFINAL assume true; 531#recEXIT >#44#return; 526#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 506#L36-3 [2018-11-28 23:24:27,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-28 23:24:27,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:27,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:27,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:28,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 23:24:28,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 23:24:28,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:28,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 23:24:28,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:28,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:28,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:28,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-28 23:24:28,425 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 23:24:28,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 23:24:28,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 23:24:28,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-28 23:24:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:28,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:28,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 23:24:28,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-28 23:24:28,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,656 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:24:29,226 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-11-28 23:24:29,474 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:24:29,955 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-11-28 23:24:30,075 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-28 23:24:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:24:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:24:30,077 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-28 23:24:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:30,202 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-28 23:24:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:24:30,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-28 23:24:30,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:30,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-28 23:24:30,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:24:30,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:24:30,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-28 23:24:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:30,209 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-28 23:24:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-28 23:24:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-28 23:24:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:24:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-28 23:24:30,214 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:30,215 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:30,215 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:30,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-28 23:24:30,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:30,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:30,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:30,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:30,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:30,217 INFO L794 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 728#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; 729#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 743#L28-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); 733#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 719#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 718#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 720#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 726#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 749#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 725#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; 727#recFINAL assume true; 748#recEXIT >#42#return; 747#L19-1 #res := #t~ret5;havoc #t~ret5; 746#recFINAL assume true; 744#recEXIT >#44#return; 742#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 738#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 739#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 721#L28-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); 722#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 715#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 714#recENTRY [2018-11-28 23:24:30,217 INFO L796 eck$LassoCheckResult]: Loop: 714#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 716#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 717#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 714#recENTRY [2018-11-28 23:24:30,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-28 23:24:30,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-28 23:24:30,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,266 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-28 23:24:30,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:30,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:30,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,476 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-28 23:24:31,105 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-28 23:24:32,434 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 225 DAG size of output: 186 [2018-11-28 23:24:32,750 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-28 23:24:33,028 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-28 23:24:33,206 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 23:24:33,209 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:33,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:33,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:33,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:33,209 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:33,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:33,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:33,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:33,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:24:33,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:33,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:33,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,383 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-28 23:24:33,494 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-28 23:24:33,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:33,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:34,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:34,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:34,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:34,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:34,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:34,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:34,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:34,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:34,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:34,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:34,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:34,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:34,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:34,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:34,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:34,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:34,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,187 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:34,187 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:34,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,190 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:24:34,190 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:34,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:34,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,222 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:34,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:34,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,233 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:34,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,250 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:34,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,257 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:34,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:34,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:34,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:34,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:34,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:34,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:34,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:34,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:34,289 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:34,314 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:34,317 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:34,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:34,318 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:34,320 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:34,320 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-28 23:24:34,376 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:24:34,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:34,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,060 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 23:24:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:35,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:35,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:35,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:35,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:35,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:35,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:35,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:24:35,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:35,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-28 23:24:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:24:35,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:35,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,502 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:35,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:35,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:35,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:35,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:35,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:35,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:35,862 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:35,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:24:35,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:36,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-28 23:24:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:24:36,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:36,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:36,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:36,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:36,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:36,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:36,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:36,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:36,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:36,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:36,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:36,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:36,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:36,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:36,358 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:24:36,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:36,455 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2018-11-28 23:24:36,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 23:24:36,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:36,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:36,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-28 23:24:36,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:36,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 23:24:36,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:36,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-28 23:24:36,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:36,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-28 23:24:36,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:36,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:36,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:36,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:36,468 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:36,468 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:36,468 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:36,468 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:36,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:36,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:36,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:36,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:36 BoogieIcfgContainer [2018-11-28 23:24:36,476 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:36,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:36,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:36,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:36,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:18" (3/4) ... [2018-11-28 23:24:36,482 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:36,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:36,483 INFO L168 Benchmark]: Toolchain (without parser) took 18949.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -302.1 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:36,484 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:36,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:36,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.38 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:36,486 INFO L168 Benchmark]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:36,486 INFO L168 Benchmark]: RCFGBuilder took 517.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:36,487 INFO L168 Benchmark]: BuchiAutomizer took 18053.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.2 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:36,488 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:36,493 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 42.38 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.74 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 517.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18053.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.2 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 6 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 18.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.8s. Construction of modules took 0.6s. Büchi inclusion checks took 3.2s. 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, 57 SDslu, 144 SDs, 0 SdLazy, 240 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp31 div100 bol100 ite100 ukn100 eq199 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...