./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex3_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_ex3_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 a96be28be4b50f026536d78db5ba85eeb0ae4413 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:21,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:21,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:21,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:21,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:21,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:21,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:21,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:21,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:21,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:21,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:21,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:21,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:21,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:21,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:21,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:21,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:21,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:21,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:21,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:21,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:21,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:21,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:21,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:21,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:21,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:21,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:21,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:21,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:21,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:21,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:21,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:21,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:21,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:21,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:21,174 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:21,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:21,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:21,194 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:21,194 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:21,195 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:21,195 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:21,195 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:21,195 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:21,196 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:21,196 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:21,196 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:21,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:21,197 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:21,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:21,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:21,197 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:21,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:21,198 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:21,198 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:21,198 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:21,198 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:21,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:21,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:21,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:21,199 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:21,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:21,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:21,200 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:21,201 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:21,201 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 -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2018-11-28 23:24:21,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:21,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:21,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:21,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:21,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:21,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-11-28 23:24:21,355 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d35604f9/0dde66482e044e1f949306a19ec83c9a/FLAG9f1ae9041 [2018-11-28 23:24:21,850 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:21,850 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-11-28 23:24:21,857 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d35604f9/0dde66482e044e1f949306a19ec83c9a/FLAG9f1ae9041 [2018-11-28 23:24:22,202 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d35604f9/0dde66482e044e1f949306a19ec83c9a [2018-11-28 23:24:22,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:22,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:22,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:22,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:22,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:22,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:22" (1/1) ... [2018-11-28 23:24:22,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3dc35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:22, skipping insertion in model container [2018-11-28 23:24:22,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:22" (1/1) ... [2018-11-28 23:24:22,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:22,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:22,437 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:22,450 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:22,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:22,486 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:22,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:22 WrapperNode [2018-11-28 23:24:22,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:22,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:22,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:22,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:22,497 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:22" (1/1) ... [2018-11-28 23:24:22,507 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:22" (1/1) ... [2018-11-28 23:24:22,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:22,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:22,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:22,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:22,539 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:22" (1/1) ... [2018-11-28 23:24:22,539 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:22" (1/1) ... [2018-11-28 23:24:22,542 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:22" (1/1) ... [2018-11-28 23:24:22,542 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:22" (1/1) ... [2018-11-28 23:24:22,548 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:22" (1/1) ... [2018-11-28 23:24:22,553 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:22" (1/1) ... [2018-11-28 23:24:22,554 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:22" (1/1) ... [2018-11-28 23:24:22,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:22,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:22,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:22,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:22,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:22" (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:22,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:22,689 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-28 23:24:22,689 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-28 23:24:22,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:22,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:22,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:22,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:22,973 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:22,973 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:24:22,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:22 BoogieIcfgContainer [2018-11-28 23:24:22,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:22,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:22,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:22,978 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:22,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:22,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:22" (1/3) ... [2018-11-28 23:24:22,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b13766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:22, skipping insertion in model container [2018-11-28 23:24:22,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:22,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:22" (2/3) ... [2018-11-28 23:24:22,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b13766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:22, skipping insertion in model container [2018-11-28 23:24:22,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:22,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:22" (3/3) ... [2018-11-28 23:24:22,985 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3_true-termination.c.i [2018-11-28 23:24:23,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:23,059 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:23,059 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:23,059 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:23,060 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:23,060 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:23,060 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:23,060 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:23,060 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:23,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:24:23,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:23,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:23,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:23,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:23,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:23,134 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:23,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:24:23,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:23,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:23,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:23,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:23,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:23,149 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L20-2true [2018-11-28 23:24:23,149 INFO L796 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 13#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 15#recFINALtrue assume true; 12#recEXITtrue >#30#return; 11#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 5#L20-2true [2018-11-28 23:24:23,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-28 23:24:23,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2018-11-28 23:24:23,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:23,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:23,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:23,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2018-11-28 23:24:23,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:23,518 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:24:23,802 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:24:24,409 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 23:24:24,554 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 23:24:24,670 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:24:24,773 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:24,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:24,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:24,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:24,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:24,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:24,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:24,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:24,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:24:24,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:24,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,844 INFO 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,001 INFO 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,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:25,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:25,259 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:25,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:25,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:25,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:25,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:25,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:25,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:25,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:25,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:25,314 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:25,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:25,316 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:24:25,317 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:25,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:25,319 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:24:25,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,571 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:25,575 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 13 treesize of output 9 [2018-11-28 23:24:25,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:25,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:25,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:25,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:25,692 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:25,708 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:25,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-28 23:24:25,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 63 states and 77 transitions. Complement of second has 22 states. [2018-11-28 23:24:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-11-28 23:24:25,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 23:24:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 23:24:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 23:24:25,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2018-11-28 23:24:25,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:24:25,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2018-11-28 23:24:25,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:24:25,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:24:25,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-28 23:24:25,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:25,955 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 23:24:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-28 23:24:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-28 23:24:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:24:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-28 23:24:25,986 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 23:24:25,986 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 23:24:25,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:25,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-11-28 23:24:25,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:24:25,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:25,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:25,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:25,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:25,989 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 162#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 174#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 175#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 185#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 156#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2018-11-28 23:24:25,990 INFO L796 eck$LassoCheckResult]: Loop: 164#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 154#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 155#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2018-11-28 23:24:25,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2018-11-28 23:24:25,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:25,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:25,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2018-11-28 23:24:26,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2018-11-28 23:24:26,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,362 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:24:26,668 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-28 23:24:26,939 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-28 23:24:26,972 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:26,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:26,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:26,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:26,972 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:26,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:26,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:26,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:26,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:24:26,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:26,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:26,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,986 INFO 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,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:26,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:26,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,079 INFO 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:27,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,088 INFO 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:27,097 INFO 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:27,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:27,118 INFO 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:27,122 INFO 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:27,125 INFO 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:27,131 INFO 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:27,132 INFO 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:27,134 INFO 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:27,138 INFO 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:27,141 INFO 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:27,144 INFO 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:27,146 INFO 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:27,537 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:27,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:27,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:27,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:27,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:27,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:27,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:27,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:27,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:27,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:27,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:27,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:27,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:27,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:27,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:27,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:27,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:27,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:27,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:27,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:27,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:27,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:27,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:27,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:27,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:27,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:27,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:27,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:27,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:27,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:27,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:27,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:27,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:27,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:27,691 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:24:27,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:27,696 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:27,697 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:27,697 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-28 23:24:27,718 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:27,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:27,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:27,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:27,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:24:28,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:28,033 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 37 treesize of output 26 [2018-11-28 23:24:28,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:28,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:24:28,096 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:28,097 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:24:28,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-28 23:24:28,243 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 17 states. [2018-11-28 23:24:28,246 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:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 23:24:28,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:24:28,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:24:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:24:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-11-28 23:24:28,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:28,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2018-11-28 23:24:28,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:24:28,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:24:28,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-11-28 23:24:28,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:28,255 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-28 23:24:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-11-28 23:24:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-28 23:24:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:24:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 23:24:28,261 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 23:24:28,261 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 23:24:28,261 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:28,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-28 23:24:28,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:28,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:28,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:28,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,264 INFO L794 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 311#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 329#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 339#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 338#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 309#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 314#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 315#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 343#recFINAL assume true; 322#recEXIT >#28#return; 323#L15-1 #res := #t~ret5;havoc #t~ret5; 337#recFINAL assume true; 332#recEXIT >#30#return; 318#L23-1 [2018-11-28 23:24:28,265 INFO L796 eck$LassoCheckResult]: Loop: 318#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 319#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 326#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 327#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 334#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 336#recFINAL assume true; 341#recEXIT >#30#return; 318#L23-1 [2018-11-28 23:24:28,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2018-11-28 23:24:28,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2018-11-28 23:24:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2018-11-28 23:24:28,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,620 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-28 23:24:29,006 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:29,365 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2018-11-28 23:24:29,415 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:29,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:29,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:29,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:29,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:29,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:29,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:29,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:29,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:24:29,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:29,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:29,419 INFO 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:29,424 INFO 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:29,425 INFO 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:29,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:29,660 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-28 23:24:29,754 INFO 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:30,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:30,047 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:30,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:30,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:30,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:30,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:30,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:30,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:30,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,118 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:24:30,118 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:30,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:30,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:30,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:30,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:30,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:30,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:30,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:30,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:30,170 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:30,189 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:30,189 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:24:30,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:30,192 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:30,192 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:30,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:30,275 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:30,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:30,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:30,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:30,806 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:30,818 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 13 treesize of output 9 [2018-11-28 23:24:30,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:30,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:30,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:30,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:30,849 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:30,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 23:24:30,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-28 23:24:31,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 130 states and 152 transitions. Complement of second has 21 states. [2018-11-28 23:24:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-28 23:24:31,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-28 23:24:31,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:31,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 23:24:31,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:31,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-28 23:24:31,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:31,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2018-11-28 23:24:31,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:24:31,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2018-11-28 23:24:31,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-28 23:24:31,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-28 23:24:31,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2018-11-28 23:24:31,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:31,082 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-11-28 23:24:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2018-11-28 23:24:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-28 23:24:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 23:24:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-28 23:24:31,093 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-28 23:24:31,093 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-28 23:24:31,093 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:31,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-11-28 23:24:31,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:24:31,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:31,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:31,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:31,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:31,097 INFO L794 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 604#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 633#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 634#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 639#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 629#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 638#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 644#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 641#recFINAL assume true; 637#recEXIT >#28#return; 636#L15-1 #res := #t~ret5;havoc #t~ret5; 635#recFINAL assume true; 632#recEXIT >#30#return; 631#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 618#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 622#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 623#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 673#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 609#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2018-11-28 23:24:31,097 INFO L796 eck$LassoCheckResult]: Loop: 608#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 611#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 610#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2018-11-28 23:24:31,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2018-11-28 23:24:31,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2018-11-28 23:24:31,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2018-11-28 23:24:31,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,574 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:24:31,767 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:24:32,160 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:32,849 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-11-28 23:24:33,247 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-28 23:24:33,315 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:33,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:33,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:33,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:33,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:33,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:33,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:33,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:33,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:24:33,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:33,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:33,323 INFO 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,349 INFO 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,351 INFO 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,353 INFO 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,355 INFO 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,357 INFO 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,359 INFO 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,362 INFO 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,365 INFO 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,367 INFO 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,369 INFO 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,374 INFO 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,375 INFO 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,381 INFO 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 INFO 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,385 INFO 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,387 INFO 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,388 INFO 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,391 INFO 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,393 INFO 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,395 INFO 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,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:33,400 INFO 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,402 INFO 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,404 INFO 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,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:33,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:33,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:33,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,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:33,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,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:33,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,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:33,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:33,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,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:33,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:33,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:33,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:33,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,897 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:33,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,898 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:33,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:33,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:33,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:33,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:33,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:33,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:33,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:33,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:33,931 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:33,935 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:33,935 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:24:33,935 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:33,936 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:33,937 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:33,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-28 23:24:33,971 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:33,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:34,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:24:34,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,272 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 37 treesize of output 26 [2018-11-28 23:24:34,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:24:34,296 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:34,296 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:34,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:34,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2018-11-28 23:24:34,451 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:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-28 23:24:34,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-28 23:24:34,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:34,452 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:34,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:24:34,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,575 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 37 treesize of output 26 [2018-11-28 23:24:34,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:24:34,602 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:34,602 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:34,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:34,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2018-11-28 23:24:34,783 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:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-28 23:24:34,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-28 23:24:34,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:34,784 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:34,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,980 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 23:24:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:24:35,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,025 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 37 treesize of output 26 [2018-11-28 23:24:35,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:24:35,060 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,061 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:35,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:35,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 154 states and 179 transitions. Complement of second has 19 states. [2018-11-28 23:24:35,167 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:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-28 23:24:35,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-28 23:24:35,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-28 23:24:35,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-28 23:24:35,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2018-11-28 23:24:35,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:35,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2018-11-28 23:24:35,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-28 23:24:35,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-28 23:24:35,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2018-11-28 23:24:35,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:35,186 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2018-11-28 23:24:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2018-11-28 23:24:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-11-28 23:24:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 23:24:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-11-28 23:24:35,200 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-28 23:24:35,200 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-28 23:24:35,200 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:35,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-11-28 23:24:35,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:35,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:35,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:35,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:35,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:35,203 INFO L794 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1356#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1357#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1371#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1374#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1378#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1376#recFINAL assume true; 1370#recEXIT >#30#return; 1366#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1368#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1372#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1373#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1400#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 1352#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1360#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1351#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1353#recFINAL assume true; 1417#recEXIT >#28#return; 1406#L15-1 #res := #t~ret5;havoc #t~ret5; 1401#recFINAL assume true; 1377#recEXIT >#30#return; 1364#L23-1 [2018-11-28 23:24:35,203 INFO L796 eck$LassoCheckResult]: Loop: 1364#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1365#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1403#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1407#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1402#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1404#recFINAL assume true; 1408#recEXIT >#30#return; 1364#L23-1 [2018-11-28 23:24:35,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2018-11-28 23:24:35,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:35,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2018-11-28 23:24:35,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2018-11-28 23:24:35,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:35,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:35,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:35,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:35,409 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:24:35,659 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-28 23:24:36,144 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:36,763 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-11-28 23:24:36,837 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:36,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:36,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:36,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:36,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:36,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:36,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:36,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:36,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:24:36,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:36,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:36,842 INFO 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:36,987 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-28 23:24:37,086 INFO 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:37,095 INFO 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:37,098 INFO 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:37,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:37,500 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:37,500 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:37,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:37,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:37,528 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:37,528 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:37,529 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:37,529 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:37,529 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:37,530 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:37,612 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:37,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,780 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:37,782 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 13 treesize of output 9 [2018-11-28 23:24:37,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:37,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:37,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:37,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:37,802 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:37,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 23:24:37,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-28 23:24:37,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2018-11-28 23:24:37,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-28 23:24:37,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 23:24:37,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,975 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:37,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:38,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:38,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:38,259 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:38,266 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 13 treesize of output 9 [2018-11-28 23:24:38,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:38,287 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:38,288 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 23:24:38,288 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-28 23:24:38,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2018-11-28 23:24:38,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-28 23:24:38,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 23:24:38,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:38,409 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:38,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:38,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:38,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:38,560 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:38,576 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 13 treesize of output 9 [2018-11-28 23:24:38,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:38,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:38,624 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:38,625 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 6 loop predicates [2018-11-28 23:24:38,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-28 23:24:38,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 143 states and 169 transitions. Complement of second has 22 states. [2018-11-28 23:24:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-11-28 23:24:38,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 23:24:38,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:38,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-28 23:24:38,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:38,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2018-11-28 23:24:38,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:38,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2018-11-28 23:24:38,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:24:38,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2018-11-28 23:24:38,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-28 23:24:38,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-11-28 23:24:38,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2018-11-28 23:24:38,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:38,818 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2018-11-28 23:24:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2018-11-28 23:24:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2018-11-28 23:24:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:24:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-28 23:24:38,824 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 23:24:38,825 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 23:24:38,825 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:38,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-11-28 23:24:38,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:24:38,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:38,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:38,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:38,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:38,828 INFO L794 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2189#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2190#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2018-11-28 23:24:38,829 INFO L796 eck$LassoCheckResult]: Loop: 2204#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2205#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2209#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 2184#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2194#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2183#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2185#recFINAL assume true; 2206#recEXIT >#28#return; 2211#L15-1 #res := #t~ret5;havoc #t~ret5; 2210#recFINAL assume true; 2208#recEXIT >#30#return; 2198#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2200#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2018-11-28 23:24:38,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2018-11-28 23:24:38,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:38,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2018-11-28 23:24:38,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2018-11-28 23:24:38,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:39,159 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:24:39,386 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:24:39,806 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:24:40,206 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:24:40,562 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:40,867 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-28 23:24:41,019 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-28 23:24:41,052 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:41,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:41,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:41,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:41,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:41,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:41,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:41,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:41,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:24:41,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:41,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:41,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:41,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:41,302 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 23:24:41,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:41,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:41,348 INFO 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:41,377 INFO 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:41,669 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:41,670 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:41,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:41,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:41,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:41,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:41,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:41,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:41,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:41,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:41,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:41,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:41,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:41,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:41,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:41,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:41,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:41,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:41,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:41,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:41,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:41,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:41,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:41,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:41,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:41,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:41,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:41,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:41,705 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:41,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:41,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:41,711 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:24:41,712 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:41,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:41,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:41,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:41,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:41,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:41,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:41,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:41,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:41,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:41,744 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:41,744 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:41,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:41,746 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:41,747 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:41,747 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:41,802 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:41,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:41,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:41,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:41,898 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:41,906 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 13 treesize of output 9 [2018-11-28 23:24:41,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:41,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:41,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:41,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-28 23:24:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:24:41,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:24:41,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-28 23:24:42,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 69 states and 86 transitions. Complement of second has 22 states. [2018-11-28 23:24:42,045 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:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-11-28 23:24:42,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-28 23:24:42,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:42,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-28 23:24:42,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:42,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-28 23:24:42,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:42,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2018-11-28 23:24:42,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:42,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-28 23:24:42,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:42,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:42,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:42,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:42,050 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:42,050 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:42,050 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:42,050 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:24:42,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:42,050 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:42,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:42,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:42 BoogieIcfgContainer [2018-11-28 23:24:42,058 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:42,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:42,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:42,058 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:42,059 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:22" (3/4) ... [2018-11-28 23:24:42,063 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:42,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:42,064 INFO L168 Benchmark]: Toolchain (without parser) took 19857.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -299.7 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:42,065 INFO L168 Benchmark]: CDTParser took 0.18 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:42,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.67 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:42,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.43 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:42,067 INFO L168 Benchmark]: Boogie Preprocessor took 28.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:42,067 INFO L168 Benchmark]: RCFGBuilder took 417.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:42,068 INFO L168 Benchmark]: BuchiAutomizer took 19083.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -146.4 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:42,069 INFO L168 Benchmark]: Witness Printer took 5.03 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:42,074 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.18 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 278.67 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.43 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 417.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19083.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -146.4 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.03 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 14.2s. Construction of modules took 0.8s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 127 SDtfs, 149 SDslu, 120 SDs, 0 SdLazy, 376 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax100 hnf100 lsp95 ukn58 mio100 lsp31 div100 bol100 ite100 ukn100 eq171 hnf90 smp97 dnf107 smp100 tf101 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 2 VariablesLoop: 4 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...