./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/count_up_and_down_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-15/count_up_and_down_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:44:19,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:44:19,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:44:19,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:44:19,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:44:19,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:44:19,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:44:19,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:44:19,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:44:19,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:44:19,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:44:19,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:44:19,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:44:19,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:44:19,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:44:19,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:44:19,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:44:19,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:44:19,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:44:19,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:44:19,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:44:19,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:44:19,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:44:19,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:44:19,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:44:19,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:44:19,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:44:19,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:44:19,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:44:19,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:44:19,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:44:19,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:44:19,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:44:19,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:44:19,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:44:19,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:44:19,624 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:44:19,654 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:44:19,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:44:19,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:44:19,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:44:19,656 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:44:19,657 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:44:19,658 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:44:19,658 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:44:19,658 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:44:19,658 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:44:19,658 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:44:19,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:44:19,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:44:19,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:44:19,661 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:44:19,661 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:44:19,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:44:19,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:44:19,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:44:19,662 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:44:19,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:44:19,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:44:19,663 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:44:19,664 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:44:19,664 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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2019-01-14 02:44:19,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:44:19,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:44:19,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:44:19,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:44:19,723 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:44:19,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2019-01-14 02:44:19,781 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d212e606/15bd5d7cc26e41878e4d5d01c8bc071d/FLAGaed7c64c1 [2019-01-14 02:44:20,285 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:44:20,286 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2019-01-14 02:44:20,299 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d212e606/15bd5d7cc26e41878e4d5d01c8bc071d/FLAGaed7c64c1 [2019-01-14 02:44:20,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d212e606/15bd5d7cc26e41878e4d5d01c8bc071d [2019-01-14 02:44:20,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:44:20,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:44:20,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:20,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:44:20,575 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:44:20,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:20" (1/1) ... [2019-01-14 02:44:20,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4768782e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:20, skipping insertion in model container [2019-01-14 02:44:20,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:20" (1/1) ... [2019-01-14 02:44:20,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:44:20,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:44:21,019 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:21,036 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:44:21,163 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:21,245 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:44:21,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21 WrapperNode [2019-01-14 02:44:21,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:21,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:21,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:44:21,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:44:21,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:21,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:44:21,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:44:21,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:44:21,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (1/1) ... [2019-01-14 02:44:21,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:44:21,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:44:21,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:44:21,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:44:21,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (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 [2019-01-14 02:44:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:44:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:44:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:44:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:44:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:44:21,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:44:21,780 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:44:21,781 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:44:21,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:21 BoogieIcfgContainer [2019-01-14 02:44:21,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:44:21,783 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:44:21,783 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:44:21,786 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:44:21,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:21,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:44:20" (1/3) ... [2019-01-14 02:44:21,788 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@317af832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:21, skipping insertion in model container [2019-01-14 02:44:21,788 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:21,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:21" (2/3) ... [2019-01-14 02:44:21,790 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@317af832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:21, skipping insertion in model container [2019-01-14 02:44:21,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:21,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:21" (3/3) ... [2019-01-14 02:44:21,793 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2019-01-14 02:44:21,872 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:44:21,873 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:44:21,873 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:44:21,873 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:44:21,873 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:44:21,874 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:44:21,874 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:44:21,874 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:44:21,874 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:44:21,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:44:21,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:44:21,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:21,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:21,915 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:44:21,915 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:21,915 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:44:21,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:44:21,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:44:21,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:21,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:21,918 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:44:21,918 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:21,926 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2019-01-14 02:44:21,927 INFO L796 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2019-01-14 02:44:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:44:21,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:21,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:21,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-14 02:44:22,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:22,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:22,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-14 02:44:22,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:22,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:22,292 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-14 02:44:22,721 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-01-14 02:44:22,848 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 02:44:22,861 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:22,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:22,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:22,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:22,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:22,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:22,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:22,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:22,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:44:22,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:22,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:22,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:22,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:22,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:22,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:22,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,193 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-14 02:44:23,686 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-14 02:44:23,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:23,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:24,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:24,076 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:24,078 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 [2019-01-14 02:44:24,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:24,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:24,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:24,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:24,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:24,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:24,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:24,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,091 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 [2019-01-14 02:44:24,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:24,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:24,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:24,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:24,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:24,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:24,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:24,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,098 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 [2019-01-14 02:44:24,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:24,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:24,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,127 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 [2019-01-14 02:44:24,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,128 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:44:24,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,139 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:44:24,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:24,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:24,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:24,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:24,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:24,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:24,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:24,280 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:24,319 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:44:24,321 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:44:24,323 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:24,325 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:24,326 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:24,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-14 02:44:24,358 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:44:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:24,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:24,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:24,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:24,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-01-14 02:44:24,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2019-01-14 02:44:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-01-14 02:44:24,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:44:24,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:24,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:44:24,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:24,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:44:24,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:24,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2019-01-14 02:44:24,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:24,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2019-01-14 02:44:24,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:24,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:44:24,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:44:24,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:24,585 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:44:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:44:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:44:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:44:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:44:24,614 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:44:24,614 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:44:24,614 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:44:24,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:44:24,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:24,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:24,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:24,617 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:24,617 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:44:24,617 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 120#L367 assume !(main_~length~0 < 1); 126#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2019-01-14 02:44:24,617 INFO L796 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2019-01-14 02:44:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-14 02:44:24,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:24,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2019-01-14 02:44:24,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:24,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2019-01-14 02:44:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:25,036 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-01-14 02:44:25,137 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:25,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:25,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:25,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:25,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:25,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:25,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:25,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:25,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:44:25,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:25,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:25,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,330 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-14 02:44:25,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:25,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:25,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:25,661 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 [2019-01-14 02:44:25,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:25,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:25,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:25,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:25,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:25,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:25,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:25,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:25,664 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 [2019-01-14 02:44:25,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:25,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:25,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:25,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:25,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:25,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:25,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:25,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:25,667 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 [2019-01-14 02:44:25,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:25,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:25,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:25,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:25,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:25,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:25,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:25,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:25,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:25,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:25,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:25,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:25,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:25,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:25,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:25,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:25,675 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 [2019-01-14 02:44:25,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:25,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:25,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:25,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:25,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:25,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:25,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:25,746 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:44:25,746 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:44:25,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:25,748 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:25,748 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:25,748 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2019-01-14 02:44:25,813 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:44:25,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:44:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:25,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:25,976 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:25,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:44:26,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 19 states and 25 transitions. Complement of second has 6 states. [2019-01-14 02:44:26,004 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 [2019-01-14 02:44:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:44:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:44:26,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:44:26,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:26,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:44:26,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:26,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-14 02:44:26,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:26,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-01-14 02:44:26,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:26,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2019-01-14 02:44:26,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:26,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:44:26,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-14 02:44:26,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:26,011 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:44:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-14 02:44:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 02:44:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:44:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:44:26,013 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:44:26,013 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:44:26,013 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:44:26,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-14 02:44:26,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:26,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:26,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:26,015 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:26,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:26,015 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 226#L367 assume !(main_~length~0 < 1); 229#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 231#L371-3 assume !(main_~i~0 < main_~length~0); 234#L371-4 main_~j~0 := 0; 227#L374-3 assume !!(main_~j~0 < main_~length~0); 219#L375-3 [2019-01-14 02:44:26,016 INFO L796 eck$LassoCheckResult]: Loop: 219#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 220#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 219#L375-3 [2019-01-14 02:44:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2019-01-14 02:44:26,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:26,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2019-01-14 02:44:26,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:26,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2019-01-14 02:44:26,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:26,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:26,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:44:26,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:44:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:44:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:44:26,430 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-14 02:44:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:44:26,531 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-01-14 02:44:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:44:26,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-14 02:44:26,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:26,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2019-01-14 02:44:26,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:44:26,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:44:26,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-01-14 02:44:26,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:26,536 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 02:44:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-01-14 02:44:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-01-14 02:44:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:44:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-14 02:44:26,539 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 02:44:26,539 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 02:44:26,539 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:44:26,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-01-14 02:44:26,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:26,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:26,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:26,541 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:26,541 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:26,541 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 280#L367 assume !(main_~length~0 < 1); 284#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 285#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 286#L371-3 assume !(main_~i~0 < main_~length~0); 290#L371-4 main_~j~0 := 0; 281#L374-3 assume !!(main_~j~0 < main_~length~0); 282#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 289#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 277#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 278#L374-3 assume !!(main_~j~0 < main_~length~0); 273#L375-3 [2019-01-14 02:44:26,541 INFO L796 eck$LassoCheckResult]: Loop: 273#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 274#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 273#L375-3 [2019-01-14 02:44:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2019-01-14 02:44:26,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:26,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:26,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:44:26,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:44:26,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:44:26,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:44:26,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:44:26,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:27,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:44:27,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-01-14 02:44:27,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:44:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2019-01-14 02:44:27,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,349 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 02:44:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:44:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:44:27,350 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 11 states. [2019-01-14 02:44:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:44:27,559 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-01-14 02:44:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:44:27,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2019-01-14 02:44:27,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:27,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 22 transitions. [2019-01-14 02:44:27,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:27,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:44:27,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-01-14 02:44:27,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:27,562 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:44:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-01-14 02:44:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 02:44:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:44:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 02:44:27,565 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 02:44:27,565 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 02:44:27,565 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:44:27,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-01-14 02:44:27,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:27,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:27,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:27,566 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:27,567 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:27,567 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 379#L367 assume !(main_~length~0 < 1); 383#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 384#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 387#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 385#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 386#L371-3 assume !(main_~i~0 < main_~length~0); 389#L371-4 main_~j~0 := 0; 380#L374-3 assume !!(main_~j~0 < main_~length~0); 381#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 388#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 376#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 377#L374-3 assume !!(main_~j~0 < main_~length~0); 372#L375-3 [2019-01-14 02:44:27,567 INFO L796 eck$LassoCheckResult]: Loop: 372#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 373#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 372#L375-3 [2019-01-14 02:44:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2019-01-14 02:44:27,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2019-01-14 02:44:27,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2019-01-14 02:44:27,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:27,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:27,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:27,847 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 02:44:28,254 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-01-14 02:44:28,314 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:28,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:28,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:28,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:28,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:28,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:28,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:28,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:28,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:44:28,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:28,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:28,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:28,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:28,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:28,693 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 [2019-01-14 02:44:28,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,699 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 [2019-01-14 02:44:28,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,702 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 [2019-01-14 02:44:28,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:28,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:28,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,712 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 [2019-01-14 02:44:28,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,718 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 [2019-01-14 02:44:28,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:28,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,730 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 [2019-01-14 02:44:28,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:28,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:28,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,737 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 [2019-01-14 02:44:28,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:44:28,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,743 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:44:28,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:28,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:28,751 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 [2019-01-14 02:44:28,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:28,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:28,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:28,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:28,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:28,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:28,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:28,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:28,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:44:28,763 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:44:28,764 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:28,764 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:44:28,766 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:28,767 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-01-14 02:44:28,778 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:44:28,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:44:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:28,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:28,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:28,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:28,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:44:28,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-01-14 02:44:28,879 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 [2019-01-14 02:44:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:44:28,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:44:28,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:28,881 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:44:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:28,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:28,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:28,938 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:28,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:44:28,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-01-14 02:44:28,958 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 [2019-01-14 02:44:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:44:28,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:44:28,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:28,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:44:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:28,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:29,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:29,015 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:29,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:44:29,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2019-01-14 02:44:29,039 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 [2019-01-14 02:44:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:44:29,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:44:29,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:29,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 02:44:29,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:29,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 02:44:29,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:29,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-01-14 02:44:29,042 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:29,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-01-14 02:44:29,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:44:29,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:44:29,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:44:29,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:29,043 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:29,043 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:29,043 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:29,043 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:44:29,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:44:29,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:29,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:44:29,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:44:29 BoogieIcfgContainer [2019-01-14 02:44:29,053 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:44:29,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:44:29,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:44:29,054 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:44:29,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:21" (3/4) ... [2019-01-14 02:44:29,060 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:44:29,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:44:29,062 INFO L168 Benchmark]: Toolchain (without parser) took 8493.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 951.4 MB in the beginning and 993.1 MB in the end (delta: -41.7 MB). Peak memory consumption was 178.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:29,064 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:29,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:29,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.92 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. [2019-01-14 02:44:29,067 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 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. [2019-01-14 02:44:29,067 INFO L168 Benchmark]: RCFGBuilder took 437.68 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:29,069 INFO L168 Benchmark]: BuchiAutomizer took 7270.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:29,070 INFO L168 Benchmark]: Witness Printer took 6.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:29,076 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.92 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. * Boogie Preprocessor took 39.91 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 437.68 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7270.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 120 SDslu, 52 SDs, 0 SdLazy, 134 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf99 lsp95 ukn75 mio100 lsp59 div100 bol100 ite100 ukn100 eq154 hnf91 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 3 VariablesLoop: 2 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...