./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_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/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_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/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-08 07:49:00,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 07:49:00,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 07:49:00,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 07:49:00,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 07:49:00,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 07:49:00,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 07:49:00,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 07:49:00,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 07:49:00,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 07:49:00,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 07:49:00,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 07:49:00,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 07:49:00,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 07:49:00,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 07:49:00,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 07:49:00,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 07:49:00,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 07:49:00,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 07:49:00,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 07:49:00,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 07:49:00,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 07:49:00,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 07:49:00,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 07:49:00,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 07:49:00,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 07:49:00,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 07:49:00,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 07:49:00,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 07:49:00,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 07:49:00,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 07:49:00,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 07:49:00,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 07:49:00,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 07:49:00,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 07:49:00,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 07:49:00,671 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 07:49:00,679 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 07:49:00,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 07:49:00,680 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 07:49:00,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 07:49:00,680 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 07:49:00,680 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 07:49:00,680 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 07:49:00,680 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 07:49:00,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 07:49:00,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 07:49:00,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 07:49:00,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 07:49:00,683 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 07:49:00,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 07:49:00,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 07:49:00,683 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 07:49:00,683 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 07:49:00,684 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_3149f340-aaaa-409e-9c42-261f102f0219/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-08 07:49:00,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 07:49:00,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 07:49:00,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 07:49:00,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 07:49:00,714 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 07:49:00,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-12-08 07:49:00,752 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/data/0878e2b8d/1ec5a51ab72e486497fc6884a3d43cc3/FLAG276fbcdc3 [2018-12-08 07:49:01,166 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 07:49:01,167 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-12-08 07:49:01,170 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/data/0878e2b8d/1ec5a51ab72e486497fc6884a3d43cc3/FLAG276fbcdc3 [2018-12-08 07:49:01,178 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/bin-2019/uautomizer/data/0878e2b8d/1ec5a51ab72e486497fc6884a3d43cc3 [2018-12-08 07:49:01,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 07:49:01,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 07:49:01,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 07:49:01,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 07:49:01,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 07:49:01,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,186 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 08.12 07:49:01, skipping insertion in model container [2018-12-08 07:49:01,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 07:49:01,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 07:49:01,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:49:01,287 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 07:49:01,295 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:49:01,304 INFO L195 MainTranslator]: Completed translation [2018-12-08 07:49:01,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01 WrapperNode [2018-12-08 07:49:01,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 07:49:01,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 07:49:01,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 07:49:01,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 07:49:01,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 07:49:01,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 07:49:01,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 07:49:01,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 07:49:01,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... [2018-12-08 07:49:01,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 07:49:01,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 07:49:01,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 07:49:01,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 07:49:01,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3149f340-aaaa-409e-9c42-261f102f0219/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-08 07:49:01,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 07:49:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-08 07:49:01,406 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-08 07:49:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 07:49:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 07:49:01,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 07:49:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 07:49:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 07:49:01,498 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 07:49:01,499 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 07:49:01,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:01 BoogieIcfgContainer [2018-12-08 07:49:01,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 07:49:01,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 07:49:01,499 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 07:49:01,502 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 07:49:01,502 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:49:01,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 07:49:01" (1/3) ... [2018-12-08 07:49:01,504 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 08.12 07:49:01, skipping insertion in model container [2018-12-08 07:49:01,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:49:01,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:01" (2/3) ... [2018-12-08 07:49:01,504 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 08.12 07:49:01, skipping insertion in model container [2018-12-08 07:49:01,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:49:01,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:01" (3/3) ... [2018-12-08 07:49:01,506 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3_true-termination.c.i [2018-12-08 07:49:01,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 07:49:01,539 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 07:49:01,539 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 07:49:01,539 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 07:49:01,539 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 07:49:01,540 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 07:49:01,540 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 07:49:01,540 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 07:49:01,540 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 07:49:01,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 07:49:01,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 07:49:01,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:01,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:01,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 07:49:01,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:01,569 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 07:49:01,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 07:49:01,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 07:49:01,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:01,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:01,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 07:49:01,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:01,575 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-08 07:49:01,576 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-08 07:49:01,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-08 07:49:01,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2018-12-08 07:49:01,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:01,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2018-12-08 07:49:01,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:01,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:01,925 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:01,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:01,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:01,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:01,926 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:01,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:01,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:01,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:01,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration1_Lasso [2018-12-08 07:49:01,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:01,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:01,940 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-08 07:49:01,945 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-08 07:49:01,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:01,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:02,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:02,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:02,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:02,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:02,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:02,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 07:49:02,119 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 07:49:02,121 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:02,121 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 07:49:02,121 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:02,121 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-08 07:49:02,122 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 07:49:02,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:02,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:02,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:02,214 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-08 07:49:02,217 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-08 07:49:02,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:02,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:02,221 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-08 07:49:02,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:02,240 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-08 07:49:02,250 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-08 07:49:02,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-12-08 07:49:02,318 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-08 07:49:02,319 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-08 07:49:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 07:49:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-12-08 07:49:02,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-08 07:49:02,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:02,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-08 07:49:02,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:02,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-08 07:49:02,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:02,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2018-12-08 07:49:02,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 07:49:02,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2018-12-08 07:49:02,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 07:49:02,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 07:49:02,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-08 07:49:02,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:49:02,333 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-08 07:49:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-08 07:49:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-08 07:49:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 07:49:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-08 07:49:02,352 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-08 07:49:02,353 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-08 07:49:02,353 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 07:49:02,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-12-08 07:49:02,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 07:49:02,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:02,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:02,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:02,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 07:49:02,354 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-08 07:49:02,354 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-08 07:49:02,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2018-12-08 07:49:02,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2018-12-08 07:49:02,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2018-12-08 07:49:02,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:02,733 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:02,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:02,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:02,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:02,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:02,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:02,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:02,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:02,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration2_Lasso [2018-12-08 07:49:02,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:02,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:02,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:02,741 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-08 07:49:02,742 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-08 07:49:02,778 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-08 07:49:02,780 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-08 07:49:02,780 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-08 07:49:02,781 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-08 07:49:02,782 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-08 07:49:02,784 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-08 07:49:02,785 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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,790 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-08 07:49:02,791 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-08 07:49:02,791 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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,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-08 07:49:02,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:02,941 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:02,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,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-08 07:49:02,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:02,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:02,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,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-08 07:49:02,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:02,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:02,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:02,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:02,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:02,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:02,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:02,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:02,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:02,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:02,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:02,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:02,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:02,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:02,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:02,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:02,999 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 07:49:02,999 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 07:49:03,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:03,001 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:49:03,001 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:03,002 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-08 07:49:03,004 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-08 07:49:03,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 07:49:03,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:03,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:03,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:03,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:03,048 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-08 07:49:03,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:03,056 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-08 07:49:03,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:03,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:03,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:03,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-08 07:49:03,075 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-08 07:49:03,075 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-08 07:49:03,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-08 07:49:03,117 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-08 07:49:03,117 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-08 07:49:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 07:49:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-08 07:49:03,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 07:49:03,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:03,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 07:49:03,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:03,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 07:49:03,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:03,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-12-08 07:49:03,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 07:49:03,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2018-12-08 07:49:03,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 07:49:03,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-08 07:49:03,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-12-08 07:49:03,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:49:03,121 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-12-08 07:49:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-12-08 07:49:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-08 07:49:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 07:49:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-08 07:49:03,124 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-08 07:49:03,124 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-08 07:49:03,124 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 07:49:03,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-12-08 07:49:03,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 07:49:03,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:03,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:03,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:03,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:03,125 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-08 07:49:03,126 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-08 07:49:03,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2018-12-08 07:49:03,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2018-12-08 07:49:03,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2018-12-08 07:49:03,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:03,606 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:03,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:03,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:03,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:03,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:03,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:03,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:03,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:03,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration3_Lasso [2018-12-08 07:49:03,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:03,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:03,609 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-08 07:49:03,610 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-08 07:49:03,611 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-08 07:49:03,612 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-08 07:49:03,721 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-08 07:49:03,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:03,838 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:03,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:03,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:03,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:03,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:03,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:03,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,866 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:49:03,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 07:49:03,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,869 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 07:49:03,869 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 07:49:03,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:03,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:03,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:03,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:03,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:03,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:03,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:03,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:03,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:03,906 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 07:49:03,906 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 07:49:03,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:03,907 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:49:03,907 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:03,907 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-08 07:49:03,912 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 07:49:03,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:03,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:03,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:03,989 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-08 07:49:03,991 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-08 07:49:03,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:03,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:03,999 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-08 07:49:03,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:04,006 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-08 07:49:04,007 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-08 07:49:04,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-12-08 07:49:04,071 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-08 07:49:04,071 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-08 07:49:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 07:49:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-08 07:49:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2018-12-08 07:49:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 07:49:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2018-12-08 07:49:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:04,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2018-12-08 07:49:04,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 07:49:04,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2018-12-08 07:49:04,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-08 07:49:04,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-12-08 07:49:04,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2018-12-08 07:49:04,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:49:04,076 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-12-08 07:49:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2018-12-08 07:49:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-12-08 07:49:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 07:49:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-12-08 07:49:04,081 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-08 07:49:04,081 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-08 07:49:04,081 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 07:49:04,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-12-08 07:49:04,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 07:49:04,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:04,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:04,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:04,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 07:49:04,082 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-08 07:49:04,083 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-08 07:49:04,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2018-12-08 07:49:04,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:04,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2018-12-08 07:49:04,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:04,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2018-12-08 07:49:04,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:04,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:04,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:04,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:04,622 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-12-08 07:49:04,890 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-08 07:49:04,947 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:04,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:04,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:04,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:04,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:04,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:04,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:04,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:04,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration4_Lasso [2018-12-08 07:49:04,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:04,948 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:04,951 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-08 07:49:04,953 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-08 07:49:04,954 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-08 07:49:04,955 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-08 07:49:04,956 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-08 07:49:04,957 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-08 07:49:04,958 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-08 07:49:04,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:04,961 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-08 07:49:04,962 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-08 07:49:04,963 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-08 07:49:04,964 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-08 07:49:04,965 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-08 07:49:04,966 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-08 07:49:04,968 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-08 07:49:04,969 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-08 07:49:04,970 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-08 07:49:04,971 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-08 07:49:04,973 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-08 07:49:04,974 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-08 07:49:04,975 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-08 07:49:04,976 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-08 07:49:04,977 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-08 07:49:04,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:04,980 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-08 07:49:05,149 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:05,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:05,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:05,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:05,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:05,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:05,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:49:05,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:49:05,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:49:05,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:05,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:49:05,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,194 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 07:49:05,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:05,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:05,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:05,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:05,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:05,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:05,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:05,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:05,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:05,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:05,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 07:49:05,206 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 07:49:05,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:05,207 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:49:05,207 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:05,207 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-08 07:49:05,209 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-08 07:49:05,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 07:49:05,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,279 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-08 07:49:05,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,281 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-08 07:49:05,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-08 07:49:05,294 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-08 07:49:05,295 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-08 07:49:05,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-08 07:49:05,353 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-08 07:49:05,353 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-08 07:49:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:49:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-12-08 07:49:05,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 07:49:05,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:05,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:49:05,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,406 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-08 07:49:05,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,409 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-08 07:49:05,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-08 07:49:05,431 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-08 07:49:05,432 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-08 07:49:05,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-08 07:49:05,479 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-08 07:49:05,480 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-08 07:49:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:49:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-12-08 07:49:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 07:49:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:05,481 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:49:05,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:05,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:05,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,546 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-08 07:49:05,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:49:05,550 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-08 07:49:05,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:05,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-08 07:49:05,566 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-08 07:49:05,566 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-08 07:49:05,566 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-08 07:49:05,624 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-08 07:49:05,625 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-08 07:49:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:49:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-08 07:49:05,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 07:49:05,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:05,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2018-12-08 07:49:05,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:05,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-08 07:49:05,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:05,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2018-12-08 07:49:05,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 07:49:05,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2018-12-08 07:49:05,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-08 07:49:05,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-12-08 07:49:05,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2018-12-08 07:49:05,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:49:05,631 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2018-12-08 07:49:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2018-12-08 07:49:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-12-08 07:49:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 07:49:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-12-08 07:49:05,636 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-08 07:49:05,636 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-08 07:49:05,636 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 07:49:05,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-12-08 07:49:05,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 07:49:05,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:05,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:05,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:05,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:05,638 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-08 07:49:05,638 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-08 07:49:05,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2018-12-08 07:49:05,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:05,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2018-12-08 07:49:05,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:05,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2018-12-08 07:49:05,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:05,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:05,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:05,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:06,370 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-12-08 07:49:06,417 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:06,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:06,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:06,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:06,418 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:06,418 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:06,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:06,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:06,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration5_Lasso [2018-12-08 07:49:06,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:06,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:06,420 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-08 07:49:06,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:06,519 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-08 07:49:06,521 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-08 07:49:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:49:06,659 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:06,659 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:06,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:06,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:06,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:06,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:06,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:06,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:06,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:06,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:06,672 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 07:49:06,672 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 07:49:06,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:06,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:49:06,673 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:06,673 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-08 07:49:06,685 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 07:49:06,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:06,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:06,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:06,754 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-08 07:49:06,756 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-08 07:49:06,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:06,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:06,763 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-08 07:49:06,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:06,772 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-08 07:49:06,772 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-08 07:49:06,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 07:49:06,829 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-08 07:49:06,829 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-08 07:49:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 07:49:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-08 07:49:06,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 07:49:06,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:06,831 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:49:06,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:06,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:06,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:06,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 07:49:06,900 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-08 07:49:06,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:06,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:06,903 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-08 07:49:06,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:06,919 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-08 07:49:06,919 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-08 07:49:06,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 07:49:06,965 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-08 07:49:06,966 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-08 07:49:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 07:49:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-12-08 07:49:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 07:49:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:06,966 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:49:06,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:06,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:07,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:07,045 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-08 07:49:07,046 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-08 07:49:07,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:07,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:07,050 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-08 07:49:07,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:07,067 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-08 07:49:07,067 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-08 07:49:07,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 07:49:07,136 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-08 07:49:07,136 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-08 07:49:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 07:49:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-12-08 07:49:07,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 07:49:07,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-12-08 07:49:07,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2018-12-08 07:49:07,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2018-12-08 07:49:07,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 07:49:07,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2018-12-08 07:49:07,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-12-08 07:49:07,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-12-08 07:49:07,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2018-12-08 07:49:07,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:49:07,141 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2018-12-08 07:49:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2018-12-08 07:49:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2018-12-08 07:49:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 07:49:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-08 07:49:07,143 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-08 07:49:07,143 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-08 07:49:07,143 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 07:49:07,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-12-08 07:49:07,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 07:49:07,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:49:07,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:49:07,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 07:49:07,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:49:07,145 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-08 07:49:07,145 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-08 07:49:07,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2018-12-08 07:49:07,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:49:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2018-12-08 07:49:07,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2018-12-08 07:49:07,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:49:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:49:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:49:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:49:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:49:07,539 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:49:07,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:49:07,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:49:07,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:49:07,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:49:07,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:49:07,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:49:07,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:49:07,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration6_Lasso [2018-12-08 07:49:07,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:49:07,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:49:07,541 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-08 07:49:07,542 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-08 07:49:07,635 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-08 07:49:07,636 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-08 07:49:07,637 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-08 07:49:07,638 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-08 07:49:07,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:49:07,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:49:07,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:07,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:07,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:07,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:07,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:07,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:07,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:07,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:07,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:07,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:07,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:07,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:07,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:07,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:07,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:07,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:07,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 07:49:07,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:07,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:07,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:07,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:07,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:07,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:07,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:07,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:07,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:07,766 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:49:07,766 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 07:49:07,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:07,767 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 07:49:07,768 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 07:49:07,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:49:07,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-08 07:49:07,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:49:07,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:49:07,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:49:07,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:49:07,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:49:07,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:49:07,778 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:49:07,780 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 07:49:07,781 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 07:49:07,781 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:49:07,781 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:49:07,781 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:49:07,781 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-08 07:49:07,785 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 07:49:07,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:49:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:07,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:49:07,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:49:07,823 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-08 07:49:07,824 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-08 07:49:07,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:49:07,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:49:07,827 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-08 07:49:07,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-08 07:49:07,851 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-08 07:49:07,852 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-08 07:49:07,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-08 07:49:07,893 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-08 07:49:07,893 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-08 07:49:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 07:49:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-08 07:49:07,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2018-12-08 07:49:07,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2018-12-08 07:49:07,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2018-12-08 07:49:07,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:49:07,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2018-12-08 07:49:07,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 07:49:07,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 07:49:07,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 07:49:07,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 07:49:07,896 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 07:49:07,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 07:49:07,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 07:49:07,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 07:49:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 07:49:07 BoogieIcfgContainer [2018-12-08 07:49:07,900 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 07:49:07,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 07:49:07,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 07:49:07,901 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 07:49:07,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:01" (3/4) ... [2018-12-08 07:49:07,904 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 07:49:07,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 07:49:07,904 INFO L168 Benchmark]: Toolchain (without parser) took 6723.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -53.4 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. [2018-12-08 07:49:07,905 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:49:07,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.22 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 07:49:07,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.15 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:49:07,905 INFO L168 Benchmark]: Boogie Preprocessor took 40.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-08 07:49:07,906 INFO L168 Benchmark]: RCFGBuilder took 126.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 07:49:07,906 INFO L168 Benchmark]: BuchiAutomizer took 6401.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.2 MB). Peak memory consumption was 186.5 MB. Max. memory is 11.5 GB. [2018-12-08 07:49:07,906 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:49:07,908 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 123.22 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.2 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 27.15 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 126.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6401.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.2 MB). Peak memory consumption was 186.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.8s. 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: 19ms 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...