./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a96be28be4b50f026536d78db5ba85eeb0ae4413 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:01:50,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:01:50,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:01:50,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:01:50,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:01:50,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:01:50,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:01:50,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:01:50,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:01:50,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:01:50,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:01:50,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:01:50,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:01:50,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:01:50,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:01:50,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:01:50,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:01:50,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:01:50,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:01:50,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:01:50,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:01:50,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:01:50,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:01:50,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:01:50,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:01:50,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:01:50,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:01:50,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:01:50,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:01:50,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:01:50,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:01:50,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:01:50,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:01:50,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:01:50,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:01:50,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:01:50,073 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 01:01:50,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:01:50,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:01:50,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:01:50,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:01:50,082 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:01:50,082 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 01:01:50,082 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 01:01:50,082 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 01:01:50,082 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 01:01:50,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 01:01:50,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 01:01:50,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 01:01:50,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:01:50,084 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 01:01:50,085 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 01:01:50,085 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2018-12-02 01:01:50,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:01:50,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:01:50,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:01:50,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:01:50,114 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:01:50,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-12-02 01:01:50,160 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/data/319101214/74361bb2875748bdb476eddb74de54c0/FLAG9fbc4dbd1 [2018-12-02 01:01:50,631 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:01:50,632 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-12-02 01:01:50,635 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/data/319101214/74361bb2875748bdb476eddb74de54c0/FLAG9fbc4dbd1 [2018-12-02 01:01:50,643 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/data/319101214/74361bb2875748bdb476eddb74de54c0 [2018-12-02 01:01:50,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:01:50,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:01:50,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:01:50,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:01:50,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:01:50,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400a5fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50, skipping insertion in model container [2018-12-02 01:01:50,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:01:50,663 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:01:50,746 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:01:50,752 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:01:50,762 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:01:50,773 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:01:50,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50 WrapperNode [2018-12-02 01:01:50,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:01:50,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:01:50,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:01:50,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:01:50,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:01:50,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:01:50,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:01:50,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:01:50,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... [2018-12-02 01:01:50,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:01:50,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:01:50,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:01:50,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:01:50,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2621ff7d-aab4-4836-a8bf-f67742a7bf7e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:01:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-02 01:01:50,866 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-02 01:01:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:01:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:01:50,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:01:50,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:01:50,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:01:50,958 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:01:50,959 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 01:01:50,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:01:50 BoogieIcfgContainer [2018-12-02 01:01:50,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:01:50,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 01:01:50,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 01:01:50,962 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 01:01:50,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:01:50,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:01:50" (1/3) ... [2018-12-02 01:01:50,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22300dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:01:50, skipping insertion in model container [2018-12-02 01:01:50,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:01:50,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:01:50" (2/3) ... [2018-12-02 01:01:50,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22300dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:01:50, skipping insertion in model container [2018-12-02 01:01:50,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:01:50,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:01:50" (3/3) ... [2018-12-02 01:01:50,965 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3_true-termination.c.i [2018-12-02 01:01:50,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:01:50,998 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 01:01:50,998 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 01:01:50,998 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 01:01:50,998 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:01:50,998 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:01:50,999 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 01:01:50,999 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:01:50,999 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 01:01:51,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 01:01:51,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 01:01:51,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:51,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:51,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:01:51,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:51,027 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 01:01:51,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 01:01:51,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 01:01:51,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:51,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:51,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:01:51,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:51,033 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-12-02 01:01:51,034 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-12-02 01:01:51,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-02 01:01:51,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2018-12-02 01:01:51,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2018-12-02 01:01:51,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,395 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:51,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:51,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:51,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:51,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:51,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:51,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:51,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:51,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration1_Lasso [2018-12-02 01:01:51,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:51,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:51,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:51,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:51,554 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:51,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:51,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:51,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:51,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:51,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:51,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:51,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:51,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:51,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:51,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-12-02 01:01:51,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:51,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:51,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:51,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:51,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:51,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:51,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:51,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:51,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:51,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:51,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:51,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:51,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:51,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:51,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:51,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:51,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:51,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:51,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:51,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:51,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:51,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:51,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:51,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:51,585 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:51,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 01:01:51,591 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 01:01:51,592 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:51,592 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 01:01:51,592 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:51,593 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 01:01:51,593 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 01:01:51,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:51,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:51,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:51,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:51,676 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-12-02 01:01:51,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:51,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:51,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:51,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:51,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 01:01:51,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-12-02 01:01:51,804 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-12-02 01:01:51,804 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-12-02 01:01:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 01:01:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-12-02 01:01:51,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-02 01:01:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:51,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-02 01:01:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:51,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-02 01:01:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:51,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2018-12-02 01:01:51,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 01:01:51,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2018-12-02 01:01:51,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 01:01:51,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 01:01:51,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-02 01:01:51,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:01:51,818 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 01:01:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-02 01:01:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-02 01:01:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 01:01:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-02 01:01:51,837 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-02 01:01:51,837 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-02 01:01:51,837 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 01:01:51,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-12-02 01:01:51,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 01:01:51,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:51,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:51,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:51,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 01:01:51,839 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-12-02 01:01:51,839 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-12-02 01:01:51,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2018-12-02 01:01:51,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2018-12-02 01:01:51,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2018-12-02 01:01:51,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:51,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,199 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:52,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:52,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:52,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:52,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:52,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:52,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:52,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:52,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration2_Lasso [2018-12-02 01:01:52,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:52,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:52,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:52,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:52,399 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:52,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:52,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:52,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:52,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:52,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:52,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:52,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:52,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:52,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:52,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:52,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:52,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:52,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:52,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:52,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:52,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:52,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:52,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:52,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:52,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:52,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:52,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:52,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:52,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:52,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:52,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:52,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:52,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:52,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:52,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:52,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 01:01:52,439 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 01:01:52,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:52,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:01:52,441 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:52,441 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-12-02 01:01:52,446 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 01:01:52,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 01:01:52,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:52,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:52,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:52,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:52,495 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-12-02 01:01:52,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:52,499 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-12-02 01:01:52,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:52,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:52,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:52,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 01:01:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:52,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 01:01:52,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-02 01:01:52,561 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-12-02 01:01:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 01:01:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 01:01:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 01:01:52,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 01:01:52,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:52,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 01:01:52,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:52,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 01:01:52,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:52,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-12-02 01:01:52,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 01:01:52,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2018-12-02 01:01:52,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 01:01:52,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 01:01:52,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-12-02 01:01:52,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:01:52,567 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-12-02 01:01:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-12-02 01:01:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-02 01:01:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 01:01:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-02 01:01:52,571 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-02 01:01:52,571 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-02 01:01:52,572 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 01:01:52,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-12-02 01:01:52,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 01:01:52,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:52,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:52,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:52,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:52,574 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-12-02 01:01:52,574 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-12-02 01:01:52,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2018-12-02 01:01:52,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:52,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2018-12-02 01:01:52,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:52,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2018-12-02 01:01:52,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:52,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,074 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:53,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:53,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:53,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:53,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:53,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:53,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:53,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:53,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration3_Lasso [2018-12-02 01:01:53,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:53,075 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:53,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:53,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:53,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:53,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:53,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:53,277 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:53,277 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:53,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:53,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:53,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:53,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 01:01:53,304 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:01:53,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,307 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 01:01:53,307 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 01:01:53,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:53,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:53,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:53,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:53,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:53,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:53,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:53,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:53,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:53,338 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 01:01:53,338 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 01:01:53,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:53,339 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:01:53,339 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:53,339 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-12-02 01:01:53,344 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 01:01:53,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:53,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:53,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:53,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:53,431 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-12-02 01:01:53,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:53,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:53,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:53,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:53,445 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-12-02 01:01:53,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-12-02 01:01:53,509 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-12-02 01:01:53,510 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-12-02 01:01:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 01:01:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-02 01:01:53,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2018-12-02 01:01:53,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:53,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-02 01:01:53,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:53,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2018-12-02 01:01:53,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:53,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2018-12-02 01:01:53,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 01:01:53,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2018-12-02 01:01:53,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-02 01:01:53,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-12-02 01:01:53,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2018-12-02 01:01:53,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:01:53,515 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-12-02 01:01:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2018-12-02 01:01:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-12-02 01:01:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 01:01:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-12-02 01:01:53,520 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-02 01:01:53,520 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-02 01:01:53,520 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 01:01:53,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-12-02 01:01:53,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 01:01:53,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:53,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:53,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:53,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 01:01:53,522 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-12-02 01:01:53,522 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-12-02 01:01:53,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2018-12-02 01:01:53,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:53,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:53,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:53,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2018-12-02 01:01:53,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:53,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2018-12-02 01:01:53,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,091 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-12-02 01:01:54,295 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-02 01:01:54,332 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:54,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:54,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:54,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:54,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:54,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:54,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:54,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:54,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration4_Lasso [2018-12-02 01:01:54,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:54,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:54,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,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-12-02 01:01:54,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-12-02 01:01:54,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-12-02 01:01:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,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-12-02 01:01:54,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,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-12-02 01:01:54,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-12-02 01:01:54,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:54,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:54,504 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:54,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:54,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:54,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:01:54,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:01:54,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:01:54,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:54,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,535 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 01:01:54,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:01:54,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:54,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:54,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:54,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-12-02 01:01:54,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:54,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:54,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:54,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:54,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:54,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:54,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:54,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 01:01:54,543 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 01:01:54,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:54,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:01:54,544 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:54,544 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-12-02 01:01:54,546 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 01:01:54,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 01:01:54,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,619 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-12-02 01:01:54,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,621 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-12-02 01:01:54,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 01:01:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:54,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 01:01:54,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-02 01:01:54,693 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-12-02 01:01:54,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 01:01:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 01:01:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-12-02 01:01:54,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-02 01:01:54,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:54,694 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:01:54,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,748 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-12-02 01:01:54,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,751 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-12-02 01:01:54,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 01:01:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:54,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 01:01:54,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-02 01:01:54,810 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-12-02 01:01:54,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 01:01:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 01:01:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-12-02 01:01:54,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-02 01:01:54,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:54,811 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:01:54,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:54,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:54,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,867 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-12-02 01:01:54,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:01:54,870 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-12-02 01:01:54,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:54,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 01:01:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:54,884 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 01:01:54,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-02 01:01:54,941 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-12-02 01:01:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 01:01:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 01:01:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-02 01:01:54,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-02 01:01:54,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:54,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2018-12-02 01:01:54,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:54,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-02 01:01:54,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:54,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2018-12-02 01:01:54,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 01:01:54,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2018-12-02 01:01:54,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-02 01:01:54,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-12-02 01:01:54,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2018-12-02 01:01:54,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:01:54,946 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2018-12-02 01:01:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2018-12-02 01:01:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-12-02 01:01:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 01:01:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-12-02 01:01:54,950 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-02 01:01:54,950 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-02 01:01:54,950 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 01:01:54,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-12-02 01:01:54,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 01:01:54,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:54,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:54,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:54,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:54,952 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-12-02 01:01:54,952 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-12-02 01:01:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2018-12-02 01:01:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2018-12-02 01:01:54,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2018-12-02 01:01:54,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:54,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:55,642 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-12-02 01:01:55,681 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:55,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:55,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:55,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:55,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:55,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:55,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:55,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:55,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration5_Lasso [2018-12-02 01:01:55,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:55,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:55,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:55,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:55,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:55,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:55,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:55,921 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:55,921 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:55,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:55,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:55,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:55,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:55,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:55,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:55,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:55,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:55,933 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 01:01:55,933 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 01:01:55,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:55,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:01:55,934 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:55,934 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-12-02 01:01:55,939 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 01:01:55,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:55,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:55,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:56,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:56,014 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-12-02 01:01:56,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:56,027 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-12-02 01:01:56,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-02 01:01:56,077 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-12-02 01:01:56,078 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-12-02 01:01:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 01:01:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-02 01:01:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-02 01:01:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:56,078 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:01:56,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:56,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:56,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:56,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:56,150 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-12-02 01:01:56,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:56,164 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-12-02 01:01:56,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-02 01:01:56,210 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-12-02 01:01:56,210 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-12-02 01:01:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 01:01:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-02 01:01:56,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-02 01:01:56,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:56,211 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:01:56,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:56,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:56,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:56,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:56,282 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-12-02 01:01:56,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:56,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:01:56,302 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-12-02 01:01:56,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-02 01:01:56,355 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-12-02 01:01:56,355 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-12-02 01:01:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 01:01:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-12-02 01:01:56,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-02 01:01:56,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:56,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-12-02 01:01:56,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:56,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2018-12-02 01:01:56,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:56,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2018-12-02 01:01:56,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 01:01:56,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2018-12-02 01:01:56,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-12-02 01:01:56,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-12-02 01:01:56,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2018-12-02 01:01:56,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:01:56,360 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2018-12-02 01:01:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2018-12-02 01:01:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2018-12-02 01:01:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 01:01:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-02 01:01:56,362 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-02 01:01:56,362 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-02 01:01:56,362 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 01:01:56,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-12-02 01:01:56,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 01:01:56,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:01:56,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:01:56,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 01:01:56,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:01:56,363 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-12-02 01:01:56,363 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-12-02 01:01:56,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2018-12-02 01:01:56,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:56,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:01:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2018-12-02 01:01:56,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2018-12-02 01:01:56,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:01:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:01:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:01:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:01:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:01:56,711 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:01:56,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:01:56,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:01:56,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:01:56,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:01:56,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:01:56,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:01:56,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:01:56,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration6_Lasso [2018-12-02 01:01:56,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:01:56,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:01:56,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:01:56,950 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:01:56,950 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:01:56,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:56,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:56,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:56,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:56,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:56,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:56,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:56,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:56,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:56,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:56,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:56,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:56,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:56,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:56,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:56,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:56,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:56,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:56,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:56,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:56,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:56,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:56,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:56,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:56,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:56,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:56,960 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 01:01:56,960 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:01:56,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:56,962 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 01:01:56,962 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 01:01:56,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:01:56,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:01:56,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:01:56,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:01:56,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:01:56,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:01:56,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:01:56,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:01:56,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:01:56,975 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 01:01:56,975 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 01:01:56,975 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:01:56,976 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:01:56,976 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:01:56,976 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 01:01:56,980 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 01:01:56,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:01:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:56,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:01:57,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:01:57,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 01:01:57,022 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-12-02 01:01:57,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:01:57,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:57,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:01:57,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-02 01:01:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 01:01:57,052 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-12-02 01:01:57,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-02 01:01:57,087 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-12-02 01:01:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-02 01:01:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 01:01:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-02 01:01:57,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2018-12-02 01:01:57,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:57,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2018-12-02 01:01:57,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:57,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2018-12-02 01:01:57,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:01:57,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2018-12-02 01:01:57,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 01:01:57,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-12-02 01:01:57,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 01:01:57,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 01:01:57,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 01:01:57,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:01:57,091 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:01:57,091 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:01:57,091 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:01:57,091 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 01:01:57,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:01:57,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 01:01:57,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 01:01:57,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:01:57 BoogieIcfgContainer [2018-12-02 01:01:57,096 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 01:01:57,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:01:57,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:01:57,096 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:01:57,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:01:50" (3/4) ... [2018-12-02 01:01:57,099 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 01:01:57,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:01:57,099 INFO L168 Benchmark]: Toolchain (without parser) took 6454.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -341.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-02 01:01:57,100 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:01:57,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.04 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:01:57,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:01:57,101 INFO L168 Benchmark]: Boogie Preprocessor took 40.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:01:57,102 INFO L168 Benchmark]: RCFGBuilder took 125.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-12-02 01:01:57,102 INFO L168 Benchmark]: BuchiAutomizer took 6136.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:01:57,102 INFO L168 Benchmark]: Witness Printer took 3.04 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-12-02 01:01:57,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.04 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 125.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6136.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 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 6.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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.2s 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: 16ms 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...