./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array01-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-memory-alloca/array01-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 10c50c605d9fb7cd886e3d668ba568a2b619230b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:29:58,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:29:58,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:29:58,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:29:58,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:29:58,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:29:58,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:29:58,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:29:58,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:29:58,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:29:58,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:29:58,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:29:58,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:29:58,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:29:58,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:29:58,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:29:58,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:29:58,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:29:58,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:29:58,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:29:58,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:29:58,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:29:58,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:29:58,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:29:58,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:29:58,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:29:58,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:29:58,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:29:58,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:29:58,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:29:58,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:29:58,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:29:58,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:29:58,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:29:58,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:29:58,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:29:58,794 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:29:58,827 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:29:58,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:29:58,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:29:58,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:29:58,830 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:29:58,830 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:29:58,830 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:29:58,830 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:29:58,830 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:29:58,831 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:29:58,831 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:29:58,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:29:58,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:29:58,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:29:58,832 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:29:58,833 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:29:58,833 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:29:58,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:29:58,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:29:58,833 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:29:58,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:29:58,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:29:58,835 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:29:58,836 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:29:58,837 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 -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2019-01-14 02:29:58,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:29:58,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:29:58,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:29:58,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:29:58,909 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:29:58,910 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2019-01-14 02:29:58,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad8c03c4/01006337c1c64950bda01e0a9ce030d3/FLAG289d73ea5 [2019-01-14 02:29:59,515 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:29:59,515 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2019-01-14 02:29:59,529 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad8c03c4/01006337c1c64950bda01e0a9ce030d3/FLAG289d73ea5 [2019-01-14 02:29:59,815 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad8c03c4/01006337c1c64950bda01e0a9ce030d3 [2019-01-14 02:29:59,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:29:59,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:29:59,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:29:59,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:29:59,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:29:59,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:29:59" (1/1) ... [2019-01-14 02:29:59,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:29:59, skipping insertion in model container [2019-01-14 02:29:59,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:29:59" (1/1) ... [2019-01-14 02:29:59,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:29:59,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:00,280 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:00,292 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:00,406 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:00,471 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:00,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00 WrapperNode [2019-01-14 02:30:00,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:00,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:00,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:00,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:00,482 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:30:00" (1/1) ... [2019-01-14 02:30:00,506 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:30:00" (1/1) ... [2019-01-14 02:30:00,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:00,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:00,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:00,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:00,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (1/1) ... [2019-01-14 02:30:00,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:00,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:00,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:00,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:00,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (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:30:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:00,968 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:00,969 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:30:00,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:00 BoogieIcfgContainer [2019-01-14 02:30:00,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:00,971 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:00,971 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:00,974 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:00,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:00,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:29:59" (1/3) ... [2019-01-14 02:30:00,977 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@150d8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:00, skipping insertion in model container [2019-01-14 02:30:00,977 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:00,977 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:00" (2/3) ... [2019-01-14 02:30:00,978 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@150d8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:00, skipping insertion in model container [2019-01-14 02:30:00,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:00,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:00" (3/3) ... [2019-01-14 02:30:00,980 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2019-01-14 02:30:01,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:01,041 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:01,042 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:01,042 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:01,042 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:01,042 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:01,042 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:01,042 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:01,043 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:01,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:30:01,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:01,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:01,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:01,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:01,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:01,098 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:01,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:30:01,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:01,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:01,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:01,101 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:01,101 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:01,110 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2019-01-14 02:30:01,111 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2019-01-14 02:30:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 02:30:01,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:01,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-14 02:30:01,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:01,319 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:30:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:30:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:30:01,325 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:30:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:30:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:30:01,343 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-14 02:30:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:01,351 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-14 02:30:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:30:01,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-14 02:30:01,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:01,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-14 02:30:01,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:30:01,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:30:01,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-14 02:30:01,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:01,362 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:30:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-14 02:30:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 02:30:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:30:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 02:30:01,394 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:30:01,394 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:30:01,395 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:01,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 02:30:01,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:01,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:01,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:01,396 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:01,396 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:01,397 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2019-01-14 02:30:01,397 INFO L796 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2019-01-14 02:30:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 02:30:01,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:01,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-14 02:30:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:01,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:01,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-14 02:30:01,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:01,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:01,991 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 02:30:02,105 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:30:02,118 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:02,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:02,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:02,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:02,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:02,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:02,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:02,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:02,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:30:02,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:02,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:02,145 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:30:02,154 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:30:02,160 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:30:02,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:30:02,173 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:30:02,177 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:30:02,179 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:30:02,184 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:30:02,217 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:30:02,520 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-14 02:30:02,703 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:30:02,704 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:30:02,733 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:30:02,758 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:30:02,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,825 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:30:02,852 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:30:02,856 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:30:03,041 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 02:30:03,428 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:03,433 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:03,434 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:30:03,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:03,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:03,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:03,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,441 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:30:03,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:03,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:03,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:03,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,445 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:30:03,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:03,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:03,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:03,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,448 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:30:03,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:03,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:03,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,456 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:30:03,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:03,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:03,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:03,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:03,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:03,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:03,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,473 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:30:03,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:03,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:03,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,490 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:30:03,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:03,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:03,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:03,503 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:30:03,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:03,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:03,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:03,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:03,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:03,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:03,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:03,686 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:30:03,689 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:30:03,693 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:03,696 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:30:03,696 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:03,697 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-01-14 02:30:03,765 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:30:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:03,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:03,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:03,860 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:30:03,863 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:30:03,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:30:03,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-14 02:30:03,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:30:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 02:30:03,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:30:03,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:03,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:30:03,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:03,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 02:30:03,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:03,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-14 02:30:03,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:30:03,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-14 02:30:03,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:30:03,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:30:03,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:30:03,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:03,922 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:30:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:30:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 02:30:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:30:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-14 02:30:03,924 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 02:30:03,924 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 02:30:03,924 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:30:03,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-14 02:30:03,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:30:03,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:03,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:03,926 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:03,926 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:30:03,926 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 116#L561 assume !(main_~array_size~0 < 1); 121#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 111#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L552-3 [2019-01-14 02:30:03,926 INFO L796 eck$LassoCheckResult]: Loop: 113#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L552-3 [2019-01-14 02:30:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 02:30:03,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-14 02:30:03,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-14 02:30:03,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:04,421 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-01-14 02:30:04,486 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:04,486 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:04,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:04,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:04,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:04,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:04,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:04,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:04,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:30:04,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:04,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:04,494 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:30:04,502 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:30:04,511 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:30:04,513 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:30:04,516 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:30:04,684 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-14 02:30:04,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:30:04,712 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:30:04,716 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:30:04,719 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:30:04,721 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:30:04,724 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:30:04,728 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:30:04,732 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:30:04,734 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:30:04,736 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:30:04,738 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:30:05,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:05,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:05,133 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:30:05,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:05,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:05,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:05,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,136 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:30:05,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:05,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,148 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:30:05,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:05,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:05,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:05,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,151 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:30:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:05,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,156 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:30:05,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:05,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:05,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:05,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,208 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:30:05,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,210 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:30:05,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,214 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:30:05,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,267 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:30:05,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:05,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:05,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:05,281 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:30:05,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:05,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:05,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:05,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:05,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:05,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:05,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:05,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:05,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:30:05,289 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:30:05,289 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:05,289 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:30:05,289 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:05,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-01-14 02:30:05,319 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:30:05,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:05,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:05,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:05,518 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:30:05,518 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:30:05,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:30:05,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2019-01-14 02:30:05,546 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:30:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:30:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:30:05,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:30:05,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:05,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:30:05,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:05,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:30:05,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:05,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-14 02:30:05,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:30:05,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-01-14 02:30:05,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:30:05,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:30:05,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 02:30:05,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:05,551 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:30:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 02:30:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 02:30:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:30:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 02:30:05,553 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:30:05,553 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:30:05,553 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:30:05,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 02:30:05,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:30:05,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:05,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:05,554 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:05,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:30:05,555 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 205#L561 assume !(main_~array_size~0 < 1); 210#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 200#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 209#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 201#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 203#L552-3 [2019-01-14 02:30:05,555 INFO L796 eck$LassoCheckResult]: Loop: 203#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 207#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 203#L552-3 [2019-01-14 02:30:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-14 02:30:05,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:05,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-14 02:30:05,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-14 02:30:05,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:06,064 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-01-14 02:30:06,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:06,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:06,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:06,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:06,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:06,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:06,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:06,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:06,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:30:06,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:06,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:06,131 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:30:06,133 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:30:06,136 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:30:06,144 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:30:06,146 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:30:06,148 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:30:06,151 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:30:06,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:30:06,433 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 02:30:06,434 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:30:06,438 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:30:06,440 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:30:06,442 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:30:06,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:30:06,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:30:06,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:30:06,449 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:30:06,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:06,825 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:06,825 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:30:06,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:06,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:06,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:06,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:06,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,834 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:30:06,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,841 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:30:06,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,846 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:30:06,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:06,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:06,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:06,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,849 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:30:06,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:06,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:06,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:06,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,851 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:30:06,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:06,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,856 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:30:06,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,858 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:30:06,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:06,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,874 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:30:06,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,899 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:30:06,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:06,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:06,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:06,906 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:30:06,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:06,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:06,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:06,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:06,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:06,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:06,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:06,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:06,914 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:30:06,914 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:30:06,915 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:06,915 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:30:06,915 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:06,915 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2019-01-14 02:30:07,016 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:30:07,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,140 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:30:07,141 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:30:07,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:30:07,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-14 02:30:07,310 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:30:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:30:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:30:07,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:30:07,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:07,311 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:30:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,364 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:30:07,364 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:30:07,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:30:07,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-14 02:30:07,384 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:30:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:30:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:30:07,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:30:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:07,385 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:30:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:07,464 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:30:07,465 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:30:07,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:30:07,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2019-01-14 02:30:07,490 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:30:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:30:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:30:07,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:30:07,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:07,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:30:07,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:07,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:30:07,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:07,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-14 02:30:07,495 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:07,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-01-14 02:30:07,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:07,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:07,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:07,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:07,496 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:07,496 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:07,496 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:07,496 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:30:07,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:07,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:07,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:07,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:07 BoogieIcfgContainer [2019-01-14 02:30:07,503 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:07,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:07,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:07,503 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:07,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:00" (3/4) ... [2019-01-14 02:30:07,508 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:07,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:07,509 INFO L168 Benchmark]: Toolchain (without parser) took 7690.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 946.0 MB in the beginning and 993.1 MB in the end (delta: -47.1 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:07,510 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:07,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:07,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.60 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:30:07,517 INFO L168 Benchmark]: Boogie Preprocessor took 43.36 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:30:07,519 INFO L168 Benchmark]: RCFGBuilder took 394.21 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:07,520 INFO L168 Benchmark]: BuchiAutomizer took 6531.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 993.1 MB in the end (delta: 88.3 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:07,521 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 993.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:07,526 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 651.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.60 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 43.36 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 394.21 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6531.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 993.1 MB in the end (delta: 88.3 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 993.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax113 hnf99 lsp80 ukn80 mio100 lsp56 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 5 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...