./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:50,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:50,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:50,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:50,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:50,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:50,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:50,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:50,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:50,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:50,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:50,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:50,581 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:50,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:50,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:50,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:50,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:50,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:50,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:50,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:50,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:50,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:50,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:50,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:50,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:50,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:50,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:50,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:50,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:50,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:50,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:50,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:50,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:50,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:50,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:50,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:50,620 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:50,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:50,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:50,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:50,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:50,655 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:50,655 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:50,655 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:50,656 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:50,656 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:50,656 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:50,656 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:50,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:50,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:50,658 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:50,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:50,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:50,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:50,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:50,659 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:50,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:50,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:50,659 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:50,660 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:50,660 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd [2018-11-28 23:19:50,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:50,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:50,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:50,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:50,741 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:50,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:50,799 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d385f71/75c68fa404984086b45baec5efd1c1fe/FLAG48e4b490b [2018-11-28 23:19:51,295 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:51,296 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:51,315 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d385f71/75c68fa404984086b45baec5efd1c1fe/FLAG48e4b490b [2018-11-28 23:19:51,609 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d385f71/75c68fa404984086b45baec5efd1c1fe [2018-11-28 23:19:51,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:51,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:51,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:51,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:51,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:51,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:51" (1/1) ... [2018-11-28 23:19:51,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b855e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:51, skipping insertion in model container [2018-11-28 23:19:51,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:51" (1/1) ... [2018-11-28 23:19:51,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:51,699 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:52,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:52,016 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:52,070 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:52,131 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:52,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52 WrapperNode [2018-11-28 23:19:52,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:52,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:52,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:52,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:52,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:52,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:52,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:52,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:52,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... [2018-11-28 23:19:52,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:52,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:52,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:52,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:52,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:52,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:52,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:52,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:52,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:52,719 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:52,719 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:52,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:52 BoogieIcfgContainer [2018-11-28 23:19:52,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:52,720 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:52,720 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:52,724 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:52,725 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:52,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:51" (1/3) ... [2018-11-28 23:19:52,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e8a979d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:52, skipping insertion in model container [2018-11-28 23:19:52,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:52,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:52" (2/3) ... [2018-11-28 23:19:52,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e8a979d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:52, skipping insertion in model container [2018-11-28 23:19:52,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:52,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:52" (3/3) ... [2018-11-28 23:19:52,729 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:52,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:52,796 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:52,797 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:52,797 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:52,797 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:52,797 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:52,797 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:52,798 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:52,798 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:52,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:52,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:52,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:52,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:52,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:52,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:52,841 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:52,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:52,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:52,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:52,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:52,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:52,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:52,851 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L555-3true [2018-11-28 23:19:52,851 INFO L796 eck$LassoCheckResult]: Loop: 7#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 14#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 5#L556-3true assume !true; 8#L556-4true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 7#L555-3true [2018-11-28 23:19:52,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:52,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:52,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:52,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-28 23:19:53,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:53,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:53,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:53,110 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:53,135 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 23:19:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:53,145 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-28 23:19:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:53,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 23:19:53,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:53,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-28 23:19:53,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:53,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:53,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 23:19:53,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:53,160 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 23:19:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:19:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 23:19:53,195 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:53,195 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:53,196 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:53,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 23:19:53,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:53,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:53,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:53,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:53,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:53,197 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-11-28 23:19:53,198 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 38#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 33#L555-3 [2018-11-28 23:19:53,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:19:53,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:53,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:53,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:53,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-28 23:19:53,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:53,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-28 23:19:53,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:53,579 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:19:53,703 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:19:54,346 WARN L180 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 23:19:54,576 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-28 23:19:54,590 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:54,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:54,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:54,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:54,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:54,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:54,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:54,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:54,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 23:19:54,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:54,593 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:54,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:54,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:54,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:54,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:54,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,498 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-28 23:19:55,652 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-11-28 23:19:55,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:55,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-28 23:19:55,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-28 23:19:55,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-28 23:19:55,940 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-28 23:19:56,444 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:56,449 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:56,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:56,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:56,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:56,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:56,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:56,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:56,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:56,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:56,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:56,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:56,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:56,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:56,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:56,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:56,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,612 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:56,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:56,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:56,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:56,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:56,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:56,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:56,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:56,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:56,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:56,682 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:56,699 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:56,699 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:56,701 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:56,703 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:56,703 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:56,704 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 23:19:57,204 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 23:19:57,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:57,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:57,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:57,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:57,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:57,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 23:19:57,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2018-11-28 23:19:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 23:19:57,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-28 23:19:57,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:57,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 23:19:57,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:57,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-28 23:19:57,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:57,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-28 23:19:57,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:57,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2018-11-28 23:19:57,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:57,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:57,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-28 23:19:57,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:57,586 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:19:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-28 23:19:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 23:19:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:19:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 23:19:57,589 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:19:57,589 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:19:57,589 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:57,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 23:19:57,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:57,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:57,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:57,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:57,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:19:57,591 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 189#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-28 23:19:57,591 INFO L796 eck$LassoCheckResult]: Loop: 196#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 190#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L556-1 assume !!(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem7 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem7; 201#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 203#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 199#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-28 23:19:57,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:19:57,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2018-11-28 23:19:57,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2018-11-28 23:19:57,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,777 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:19:57,929 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:19:58,305 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 23:19:58,433 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-28 23:19:58,437 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:58,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:58,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:58,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:58,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:58,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:58,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:58,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:58,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 23:19:58,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:58,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:58,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,913 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-11-28 23:19:59,044 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-28 23:19:59,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:59,818 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:59,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:59,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:59,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:59,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:59,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:59,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:59,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:59,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:59,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:59,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:59,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:59,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,870 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:59,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,872 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:59,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,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-28 23:19:59,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,894 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:59,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:59,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:59,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:59,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:59,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:59,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:59,926 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:59,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:59,928 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:59,928 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:59,928 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-28 23:20:00,078 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 23:20:00,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:00,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:00,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:00,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:00,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:00,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 23:20:00,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:00,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 23:20:00,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:00,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:00,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:00,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 23:20:00,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:00,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2018-11-28 23:20:00,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:00,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-28 23:20:00,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:00,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:00,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-11-28 23:20:00,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:20:00,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:20:00,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:00,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:37 [2018-11-28 23:20:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:00,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:20:00,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 23:20:00,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 46 transitions. Complement of second has 6 states. [2018-11-28 23:20:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:20:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:20:00,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-28 23:20:00,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-28 23:20:00,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-28 23:20:00,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-11-28 23:20:00,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:00,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-28 23:20:00,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:00,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:00,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:00,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:00,820 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:00,820 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:00,821 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:00,821 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:00,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:00,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:00,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:00,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:00 BoogieIcfgContainer [2018-11-28 23:20:00,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:00,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:00,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:00,828 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:00,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:52" (3/4) ... [2018-11-28 23:20:00,832 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:00,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:00,833 INFO L168 Benchmark]: Toolchain (without parser) took 9218.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 947.3 MB in the beginning and 907.2 MB in the end (delta: 40.2 MB). Peak memory consumption was 259.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:00,834 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:00,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.81 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:00,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:00,837 INFO L168 Benchmark]: Boogie Preprocessor took 32.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:00,837 INFO L168 Benchmark]: RCFGBuilder took 429.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:00,839 INFO L168 Benchmark]: BuchiAutomizer took 8107.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 907.2 MB in the end (delta: 208.4 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:00,840 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 907.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:00,846 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 514.81 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 429.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8107.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 907.2 MB in the end (delta: 208.4 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 907.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax106 hnf100 lsp91 ukn60 mio100 lsp34 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...