./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/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 faaae9aa069653e753b732f00a89bd7a139fa132 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:09:22,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:09:22,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:09:22,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:09:22,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:09:22,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:09:22,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:09:22,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:09:22,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:09:22,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:09:22,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:09:22,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:09:22,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:09:22,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:09:22,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:09:22,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:09:22,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:09:22,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:09:22,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:09:22,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:09:22,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:09:22,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:09:22,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:09:22,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:09:22,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:09:22,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:09:22,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:09:22,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:09:22,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:09:22,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:09:22,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:09:22,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:09:22,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:09:22,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:09:22,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:09:22,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:09:22,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:09:22,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:09:22,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:09:22,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:09:22,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:09:22,613 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:09:22,614 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:09:22,614 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:09:22,614 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:09:22,614 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:09:22,614 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:09:22,615 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:09:22,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:09:22,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:09:22,616 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:09:22,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:09:22,616 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:09:22,617 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:09:22,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:09:22,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:09:22,618 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:09:22,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:09:22,618 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:09:22,618 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:09:22,619 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:09:22,619 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_f6041e10-2b91-4d2f-9d08-537f7fee90ec/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2018-11-18 15:09:22,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:09:22,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:09:22,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:09:22,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:09:22,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:09:22,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-18 15:09:22,697 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/data/1eb1b05e1/bf70ce9e51524531b6ebebfb7a4451ce/FLAGb20806352 [2018-11-18 15:09:23,124 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:09:23,124 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-18 15:09:23,129 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/data/1eb1b05e1/bf70ce9e51524531b6ebebfb7a4451ce/FLAGb20806352 [2018-11-18 15:09:23,141 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/data/1eb1b05e1/bf70ce9e51524531b6ebebfb7a4451ce [2018-11-18 15:09:23,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:09:23,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:09:23,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:09:23,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:09:23,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:09:23,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44aa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23, skipping insertion in model container [2018-11-18 15:09:23,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:09:23,176 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:09:23,306 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:09:23,312 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:09:23,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:09:23,331 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:09:23,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23 WrapperNode [2018-11-18 15:09:23,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:09:23,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:09:23,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:09:23,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:09:23,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:09:23,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:09:23,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:09:23,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:09:23,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... [2018-11-18 15:09:23,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:09:23,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:09:23,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:09:23,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:09:23,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/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-11-18 15:09:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:09:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-18 15:09:23,442 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-18 15:09:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:09:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:09:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:09:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:09:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:09:23,562 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:09:23,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:09:23 BoogieIcfgContainer [2018-11-18 15:09:23,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:09:23,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:09:23,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:09:23,565 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:09:23,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:09:23,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:09:23" (1/3) ... [2018-11-18 15:09:23,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7008fbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:09:23, skipping insertion in model container [2018-11-18 15:09:23,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:09:23,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:09:23" (2/3) ... [2018-11-18 15:09:23,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7008fbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:09:23, skipping insertion in model container [2018-11-18 15:09:23,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:09:23,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:09:23" (3/3) ... [2018-11-18 15:09:23,569 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-11-18 15:09:23,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:09:23,612 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:09:23,612 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:09:23,612 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:09:23,612 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:09:23,612 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:09:23,612 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:09:23,612 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:09:23,612 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:09:23,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:09:23,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:23,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:23,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:23,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:09:23,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:23,650 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:09:23,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:09:23,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:23,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:23,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:23,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:09:23,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:23,659 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 5#L31-4true [2018-11-18 15:09:23,660 INFO L796 eck$LassoCheckResult]: Loop: 5#L31-4true assume true; 11#L31-1true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-2true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 19#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 4#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 18#recFINALtrue assume true; 16#recEXITtrue >#45#return; 7#L39-1true assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 21#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 5#L31-4true [2018-11-18 15:09:23,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-18 15:09:23,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:23,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:23,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1057388751, now seen corresponding path program 1 times [2018-11-18 15:09:23,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:23,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:23,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:09:23,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:09:23,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:09:23,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:09:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:09:23,877 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2018-11-18 15:09:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:09:23,954 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-18 15:09:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:09:23,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2018-11-18 15:09:23,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:23,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 20 transitions. [2018-11-18 15:09:23,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 15:09:23,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 15:09:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 15:09:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:09:23,964 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 15:09:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 15:09:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 15:09:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 15:09:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 15:09:23,983 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 15:09:23,983 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 15:09:23,983 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:09:23,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-18 15:09:23,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:23,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:23,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:23,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:09:23,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:23,985 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L31-4 [2018-11-18 15:09:23,985 INFO L796 eck$LassoCheckResult]: Loop: 57#L31-4 assume true; 58#L31-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 63#L31-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 64#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 54#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 53#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 56#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 55#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 53#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 56#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 66#recFINAL assume true; 68#recEXIT >#43#return; 61#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 62#recFINAL assume true; 69#recEXIT >#45#return; 59#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 60#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 57#L31-4 [2018-11-18 15:09:23,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-18 15:09:23,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:23,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:23,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -263422331, now seen corresponding path program 1 times [2018-11-18 15:09:23,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:23,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:23,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:09:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:24,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:09:24,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6041e10-2b91-4d2f-9d08-537f7fee90ec/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:09:24,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:24,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:24,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-18 15:09:24,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:24,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-18 15:09:24,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 15:09:24,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-18 15:09:24,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:24,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:09:24,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:09:24,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-18 15:09:24,416 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 15:09:24,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:24,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 15:09:24,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 15:09:24,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:24,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:24,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:24,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-18 15:09:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:24,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:09:24,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-18 15:09:24,462 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:09:24,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:09:24,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:09:24,463 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-18 15:09:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:09:24,582 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 15:09:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:09:24,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 15:09:24,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:24,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-18 15:09:24,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 15:09:24,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 15:09:24,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-18 15:09:24,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:09:24,586 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 15:09:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-18 15:09:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-18 15:09:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 15:09:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 15:09:24,589 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 15:09:24,589 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 15:09:24,589 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:09:24,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 15:09:24,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 15:09:24,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:24,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:24,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:09:24,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:24,591 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 161#L31-4 [2018-11-18 15:09:24,591 INFO L796 eck$LassoCheckResult]: Loop: 161#L31-4 assume true; 162#L31-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 167#L31-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 168#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 158#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 157#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 160#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 159#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 157#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 160#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 170#recFINAL assume true; 172#recEXIT >#43#return; 165#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 166#recFINAL assume true; 173#recEXIT >#45#return; 163#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 164#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 161#L31-4 [2018-11-18 15:09:24,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2018-11-18 15:09:24,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:24,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -263422393, now seen corresponding path program 1 times [2018-11-18 15:09:24,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:24,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:09:24,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash 778196421, now seen corresponding path program 1 times [2018-11-18 15:09:24,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:24,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:24,947 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-18 15:09:25,354 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2018-11-18 15:09:25,498 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:09:25,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:09:25,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:09:25,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:09:25,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:09:25,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:09:25,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:09:25,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:09:25,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-11-18 15:09:25,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:09:25,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:09:25,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,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-11-18 15:09:25,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:25,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:09:25,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:09:25,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,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-11-18 15:09:25,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,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-11-18 15:09:25,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:25,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:25,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:25,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:25,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:25,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:25,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:25,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:25,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:25,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:25,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:25,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:09:25,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:09:25,934 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 15:09:25,936 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:09:25,937 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:09:25,937 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:09:25,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-18 15:09:25,954 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 15:09:25,958 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:09:25,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:25,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:25,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:26,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:26,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:26,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 15:09:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-18 15:09:26,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:09:26,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-18 15:09:26,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 15:09:26,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-18 15:09:26,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:09:26,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-18 15:09:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:09:26,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 15:09:26,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 15:09:26,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 48 states and 55 transitions. Complement of second has 18 states. [2018-11-18 15:09:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-18 15:09:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 15:09:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-18 15:09:26,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 2 letters. Loop has 17 letters. [2018-11-18 15:09:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 19 letters. Loop has 17 letters. [2018-11-18 15:09:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 2 letters. Loop has 34 letters. [2018-11-18 15:09:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:26,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2018-11-18 15:09:26,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:09:26,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 34 states and 39 transitions. [2018-11-18 15:09:26,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:09:26,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 15:09:26,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2018-11-18 15:09:26,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:09:26,143 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 15:09:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2018-11-18 15:09:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-18 15:09:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:09:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-18 15:09:26,145 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 15:09:26,145 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 15:09:26,145 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:09:26,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-18 15:09:26,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:09:26,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:26,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:26,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:26,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:09:26,146 INFO L794 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 343#L31-4 assume true; 345#L31-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 353#L31-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 354#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 339#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 336#recENTRY [2018-11-18 15:09:26,147 INFO L796 eck$LassoCheckResult]: Loop: 336#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 338#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 337#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 336#recENTRY [2018-11-18 15:09:26,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 552623682, now seen corresponding path program 1 times [2018-11-18 15:09:26,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:26,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:26,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:26,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 29957, now seen corresponding path program 1 times [2018-11-18 15:09:26,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 602465060, now seen corresponding path program 1 times [2018-11-18 15:09:26,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:26,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:26,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:26,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:26,448 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-18 15:09:26,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:09:26,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:09:26,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:09:26,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:09:26,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:09:26,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:09:26,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:09:26,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:09:26,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration4_Lasso [2018-11-18 15:09:26,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:09:26,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:09:26,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:26,918 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:09:26,918 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:09:26,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:26,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:26,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,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-11-18 15:09:26,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:26,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:26,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:26,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:26,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:26,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,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-11-18 15:09:26,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:26,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:26,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:26,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:26,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:26,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:26,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:26,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:26,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:26,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:26,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:09:26,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:09:26,978 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:09:26,978 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:09:26,978 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:09:26,979 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:09:26,979 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-18 15:09:26,990 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 15:09:26,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:09:27,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:27,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:27,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:27,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 15:09:27,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 15:09:27,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:27,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:27,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 15:09:27,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 15:09:27,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:09:27,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:09:27,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 15:09:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:27,147 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 15:09:27,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 15:09:27,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 61 states and 70 transitions. Complement of second has 14 states. [2018-11-18 15:09:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 15:09:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:09:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 15:09:27,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 15:09:27,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:27,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 15:09:27,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:27,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 15:09:27,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:27,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 70 transitions. [2018-11-18 15:09:27,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:09:27,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 42 states and 50 transitions. [2018-11-18 15:09:27,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 15:09:27,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 15:09:27,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2018-11-18 15:09:27,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:09:27,197 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 15:09:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2018-11-18 15:09:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-18 15:09:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 15:09:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-18 15:09:27,202 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 15:09:27,202 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 15:09:27,202 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:09:27,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2018-11-18 15:09:27,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:09:27,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:09:27,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:09:27,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:09:27,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:09:27,204 INFO L794 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 506#L31-4 assume true; 507#L31-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 523#L31-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 524#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 538#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 516#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 537#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 525#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 526#recFINAL assume true; 530#recEXIT >#43#return; 531#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 534#recFINAL assume true; 533#recEXIT >#45#return; 511#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 512#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 508#L31-4 assume true; 510#L31-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 521#L31-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 522#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 500#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 499#recENTRY [2018-11-18 15:09:27,204 INFO L796 eck$LassoCheckResult]: Loop: 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 502#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 501#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 499#recENTRY [2018-11-18 15:09:27,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash -608018816, now seen corresponding path program 2 times [2018-11-18 15:09:27,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:27,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:27,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:09:27,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29957, now seen corresponding path program 2 times [2018-11-18 15:09:27,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:09:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1611460058, now seen corresponding path program 3 times [2018-11-18 15:09:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:09:27,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:09:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:09:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:09:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:09:27,686 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-18 15:09:29,009 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 198 [2018-11-18 15:09:29,298 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-18 15:09:29,579 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 15:09:29,720 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 15:09:29,722 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:09:29,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:09:29,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:09:29,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:09:29,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:09:29,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:09:29,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:09:29,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:09:29,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-11-18 15:09:29,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:09:29,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:09:29,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:29,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:09:30,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:09:30,075 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:09:30,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:30,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:30,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:30,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:30,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,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-11-18 15:09:30,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:09:30,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:09:30,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:09:30,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:30,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:30,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:30,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:30,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:09:30,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:09:30,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:09:30,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:09:30,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:09:30,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:09:30,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:09:30,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:09:30,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:09:30,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:09:30,118 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:09:30,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:09:30,119 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:09:30,119 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:09:30,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-18 15:09:30,154 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 15:09:30,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:09:30,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 15:09:30,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 15:09:30,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:30,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:30,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 15:09:30,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:09:30,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 15:09:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:30,316 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 15:09:30,316 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 15:09:30,359 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 57 transitions. Complement of second has 14 states. [2018-11-18 15:09:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 15:09:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:09:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 15:09:30,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 15:09:30,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:30,362 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:09:30,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 15:09:30,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 15:09:30,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:30,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:30,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 15:09:30,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:09:30,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 15:09:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:30,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 15:09:30,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 15:09:30,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 57 transitions. Complement of second has 14 states. [2018-11-18 15:09:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 15:09:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:09:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 15:09:30,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 15:09:30,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:30,624 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:09:30,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:09:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:09:30,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:09:30,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 15:09:30,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 15:09:30,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:09:30,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:09:30,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 15:09:30,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:09:30,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:09:30,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 15:09:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:09:30,767 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 15:09:30,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 15:09:30,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2018-11-18 15:09:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 15:09:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:09:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-18 15:09:30,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 15:09:30,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:30,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-18 15:09:30,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:30,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-18 15:09:30,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:09:30,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-11-18 15:09:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:09:30,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:09:30,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:09:30,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:09:30,820 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:09:30,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:09:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:09:30,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:09:30,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:09:30 BoogieIcfgContainer [2018-11-18 15:09:30,824 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:09:30,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:09:30,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:09:30,825 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:09:30,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:09:23" (3/4) ... [2018-11-18 15:09:30,828 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:09:30,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:09:30,828 INFO L168 Benchmark]: Toolchain (without parser) took 7684.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -84.3 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:09:30,829 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:09:30,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:09:30,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.20 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:09:30,830 INFO L168 Benchmark]: Boogie Preprocessor took 13.00 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:09:30,830 INFO L168 Benchmark]: RCFGBuilder took 196.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:09:30,830 INFO L168 Benchmark]: BuchiAutomizer took 7261.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.4 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:09:30,831 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:09:30,833 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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 21.20 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.00 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 196.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7261.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.4 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.4 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 146 SDs, 0 SdLazy, 236 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax100 hnf99 lsp97 ukn42 mio100 lsp30 div100 bol100 ite100 ukn100 eq173 hnf90 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...