./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/count_down-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/count_down-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9016787135830d25851d4a1126db5f65005e4eb5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:48:57,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:48:57,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:48:57,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:48:57,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:48:57,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:48:57,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:48:57,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:48:57,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:48:57,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:48:57,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:48:57,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:48:57,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:48:57,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:48:57,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:48:57,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:48:57,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:48:57,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:48:57,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:48:57,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:48:57,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:48:57,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:48:57,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:48:57,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:48:57,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:48:57,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:48:57,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:48:57,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:48:57,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:48:57,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:48:57,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:48:57,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:48:57,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:48:57,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:48:57,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:48:57,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:48:57,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:48:57,123 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:48:57,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:48:57,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:48:57,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:48:57,126 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:48:57,126 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:48:57,126 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:48:57,126 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:48:57,126 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:48:57,128 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:48:57,128 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:48:57,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:48:57,129 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:48:57,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:48:57,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:48:57,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:48:57,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:48:57,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:48:57,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:48:57,130 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:48:57,130 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:48:57,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:48:57,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:48:57,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:48:57,131 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:48:57,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:48:57,131 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:48:57,131 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:48:57,134 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:48:57,134 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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2019-01-01 21:48:57,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:48:57,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:48:57,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:48:57,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:48:57,192 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:48:57,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2019-01-01 21:48:57,264 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650e86cba/f67ccc0423b64a07b2bc14b6ad0517ec/FLAGb1693ea70 [2019-01-01 21:48:57,723 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:48:57,724 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2019-01-01 21:48:57,739 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650e86cba/f67ccc0423b64a07b2bc14b6ad0517ec/FLAGb1693ea70 [2019-01-01 21:48:58,053 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650e86cba/f67ccc0423b64a07b2bc14b6ad0517ec [2019-01-01 21:48:58,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:48:58,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:48:58,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:58,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:48:58,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:48:58,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fa1603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58, skipping insertion in model container [2019-01-01 21:48:58,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:48:58,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:48:58,521 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:58,539 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:48:58,615 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:58,677 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:48:58,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58 WrapperNode [2019-01-01 21:48:58,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:58,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:58,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:48:58,679 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:48:58,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:58,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:48:58,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:48:58,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:48:58,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (1/1) ... [2019-01-01 21:48:58,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:48:58,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:48:58,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:48:58,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:48:58,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (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-01 21:48:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:48:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:48:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:48:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:48:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:48:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:48:59,327 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:48:59,328 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:48:59,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:59 BoogieIcfgContainer [2019-01-01 21:48:59,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:48:59,329 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:48:59,329 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:48:59,333 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:48:59,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:59,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:48:58" (1/3) ... [2019-01-01 21:48:59,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6466bff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:59, skipping insertion in model container [2019-01-01 21:48:59,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:59,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:58" (2/3) ... [2019-01-01 21:48:59,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6466bff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:59, skipping insertion in model container [2019-01-01 21:48:59,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:59,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:59" (3/3) ... [2019-01-01 21:48:59,339 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-termination.c.i [2019-01-01 21:48:59,397 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:48:59,398 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:48:59,398 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:48:59,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:48:59,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:48:59,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:48:59,400 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:48:59,400 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:48:59,400 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:48:59,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:48:59,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:48:59,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:59,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:59,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:59,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:59,450 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:48:59,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:48:59,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:48:59,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:59,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:59,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:59,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:59,462 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2019-01-01 21:48:59,463 INFO L796 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2019-01-01 21:48:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 21:48:59,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-01-01 21:48:59,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:59,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-01-01 21:48:59,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:59,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:00,203 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 21:49:00,260 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:00,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:00,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:00,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:00,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:00,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:00,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:00,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:00,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:49:00,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:00,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:00,290 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-01 21:49:00,309 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-01 21:49:00,342 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-01 21:49:00,346 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-01 21:49:00,352 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-01 21:49:00,612 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 21:49:00,653 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-01 21:49:00,657 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-01 21:49:00,664 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-01 21:49:00,667 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-01 21:49:00,671 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-01 21:49:00,676 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-01 21:49:00,682 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-01 21:49:00,722 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-01 21:49:00,725 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-01 21:49:00,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-01 21:49:01,043 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:49:01,415 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 21:49:01,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:01,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:01,540 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-01 21:49:01,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:01,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:01,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:01,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,556 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-01 21:49:01,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:01,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:01,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:01,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,564 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-01 21:49:01,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:01,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:01,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:01,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,576 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-01 21:49:01,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:01,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:01,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:01,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,581 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-01 21:49:01,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,583 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:01,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,588 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:49:01,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:01,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,612 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-01 21:49:01,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:01,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:01,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:01,631 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-01 21:49:01,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:01,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:01,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:01,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:01,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:01,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:01,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:01,762 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:49:01,762 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:49:01,765 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:01,766 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:01,767 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:01,767 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 21:49:01,816 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:49:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:01,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:01,946 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-01 21:49:01,962 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-01 21:49:01,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-01 21:49:02,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-01-01 21:49:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-01-01 21:49:02,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:49:02,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:02,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:49:02,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:02,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 21:49:02,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:02,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-01-01 21:49:02,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:02,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-01-01 21:49:02,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:49:02,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:02,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-01 21:49:02,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:02,060 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:49:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-01 21:49:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 21:49:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:49:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-01 21:49:02,086 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:49:02,086 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:49:02,086 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:02,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-01 21:49:02,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:02,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:02,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:02,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:02,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:49:02,088 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L551 assume !(main_~length~0 < 1); 138#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 134#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 135#L554-3 assume !(main_~i~0 < main_~length~0); 139#L554-4 main_~j~0 := 0; 127#L561-3 [2019-01-01 21:49:02,088 INFO L796 eck$LassoCheckResult]: Loop: 127#L561-3 assume !!(main_~j~0 < main_~length~0); 128#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 140#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 141#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 127#L561-3 [2019-01-01 21:49:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-01-01 21:49:02,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:02,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:02,170 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-01 21:49:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:49:02,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:49:02,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:49:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-01-01 21:49:02,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:49:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:49:02,242 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:49:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:02,294 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 21:49:02,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:49:02,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 21:49:02,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:02,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-01-01 21:49:02,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:49:02,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:02,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-01 21:49:02,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:02,297 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 21:49:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-01 21:49:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-01 21:49:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:49:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-01 21:49:02,301 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 21:49:02,301 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 21:49:02,301 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:49:02,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-01 21:49:02,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:02,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:02,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:02,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:02,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:49:02,303 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 173#L551 assume !(main_~length~0 < 1); 178#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 169#L556 assume !(main_~val~0 < 0); 170#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 171#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 177#L554-3 assume !(main_~i~0 < main_~length~0); 179#L554-4 main_~j~0 := 0; 167#L561-3 [2019-01-01 21:49:02,304 INFO L796 eck$LassoCheckResult]: Loop: 167#L561-3 assume !!(main_~j~0 < main_~length~0); 168#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 180#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 181#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L561-3 [2019-01-01 21:49:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:02,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-01-01 21:49:02,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:02,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-01-01 21:49:02,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:02,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-01-01 21:49:02,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:02,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:02,885 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-01-01 21:49:02,980 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:02,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:02,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:02,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:02,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:02,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:02,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:02,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:02,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:49:02,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:02,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:02,991 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-01 21:49:02,994 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-01 21:49:02,996 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-01 21:49:03,162 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-01 21:49:03,195 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-01 21:49:03,198 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-01 21:49:03,206 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-01 21:49:03,208 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-01 21:49:03,212 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-01 21:49:03,214 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-01 21:49:03,221 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-01 21:49:03,223 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-01 21:49:03,225 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-01 21:49:03,234 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-01 21:49:03,237 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-01 21:49:03,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:03,570 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:03,571 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-01 21:49:03,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:03,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:03,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:03,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:03,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:03,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:03,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:03,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:03,577 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-01 21:49:03,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:03,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:03,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:03,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:03,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:03,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:03,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:03,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:03,582 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-01 21:49:03,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:03,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:03,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:03,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:03,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:03,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:03,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:03,632 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:49:03,632 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:49:03,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:03,635 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:03,635 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:03,636 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 21:49:03,723 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:49:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:03,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:03,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:03,928 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-01 21:49:03,929 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-01 21:49:03,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:49:04,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2019-01-01 21:49:04,037 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-01 21:49:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 21:49:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 21:49:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-01 21:49:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-01 21:49:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:04,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-01 21:49:04,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:04,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2019-01-01 21:49:04,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:49:04,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:04,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-01-01 21:49:04,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:04,048 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 21:49:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-01-01 21:49:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-01 21:49:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:49:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-01 21:49:04,056 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:49:04,056 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:49:04,056 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:49:04,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-01 21:49:04,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:04,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:04,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:04,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:04,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:04,060 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 287#L551 assume !(main_~length~0 < 1); 293#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 288#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 289#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 283#L556 assume !(main_~val~0 < 0); 284#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 285#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 291#L554-3 assume !(main_~i~0 < main_~length~0); 292#L554-4 main_~j~0 := 0; 279#L561-3 assume !!(main_~j~0 < main_~length~0); 281#L562-3 [2019-01-01 21:49:04,060 INFO L796 eck$LassoCheckResult]: Loop: 281#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 294#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 281#L562-3 [2019-01-01 21:49:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-01-01 21:49:04,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-01-01 21:49:04,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:04,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:04,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-01-01 21:49:04,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,438 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-01-01 21:49:04,487 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:04,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:04,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:04,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:04,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:04,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:04,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:04,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:04,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:49:04,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:04,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:04,492 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-01 21:49:04,498 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-01 21:49:04,500 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-01 21:49:04,503 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-01 21:49:04,506 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-01 21:49:04,509 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-01 21:49: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-01 21:49:04,515 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-01 21:49:04,714 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-01 21:49:05,048 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-01 21:49:05,048 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-01 21:49:05,051 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-01 21:49:05,052 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-01 21:49:05,054 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-01 21:49:05,055 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-01 21:49:05,067 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-01 21:49:05,397 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:05,397 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:05,398 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-01 21:49:05,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:05,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:05,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:05,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,403 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-01 21:49:05,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:05,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:05,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:05,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,410 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-01 21:49:05,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,422 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-01 21:49:05,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:05,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:05,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:05,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,425 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-01 21:49:05,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,429 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-01 21:49:05,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:05,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:05,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:05,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,440 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-01 21:49:05,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,457 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-01 21:49:05,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,485 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-01 21:49:05,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,502 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-01 21:49:05,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,508 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:05,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,511 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:49:05,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:05,523 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-01 21:49:05,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:05,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:05,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:05,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:05,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:05,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:05,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:05,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:05,560 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:49:05,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:05,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:05,561 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:05,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2019-01-01 21:49:05,590 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:49:05,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:49:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:05,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:05,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:05,834 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-01 21:49:05,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:05,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:49:05,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2019-01-01 21:49:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-01 21:49:05,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:49:05,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:05,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 21:49:05,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:05,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 21:49:05,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:05,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-01-01 21:49:05,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:05,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-01-01 21:49:05,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:49:05,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:49:05,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-01-01 21:49:05,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:05,889 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-01 21:49:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-01-01 21:49:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 21:49:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:49:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-01 21:49:05,891 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-01 21:49:05,891 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-01 21:49:05,891 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:49:05,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-01 21:49:05,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:05,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:05,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:05,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:05,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:05,893 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 422#L551 assume !(main_~length~0 < 1); 427#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 423#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 424#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 418#L556 assume !(main_~val~0 < 0); 419#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 420#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 426#L554-3 assume !(main_~i~0 < main_~length~0); 428#L554-4 main_~j~0 := 0; 413#L561-3 assume !!(main_~j~0 < main_~length~0); 414#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 431#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L561-3 assume !!(main_~j~0 < main_~length~0); 417#L562-3 [2019-01-01 21:49:05,893 INFO L796 eck$LassoCheckResult]: Loop: 417#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 429#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 417#L562-3 [2019-01-01 21:49:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-01-01 21:49:05,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:06,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:49:06,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:49:06,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:49:06,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:49:06,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:49:06,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:06,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:49:06,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-01-01 21:49:06,253 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:49:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-01-01 21:49:06,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:06,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:06,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:06,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:49:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:49:06,347 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-01-01 21:49:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:06,839 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-01-01 21:49:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 21:49:06,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-01-01 21:49:06,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:06,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-01-01 21:49:06,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:49:06,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:49:06,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-01 21:49:06,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:06,844 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-01 21:49:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-01 21:49:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-01 21:49:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 21:49:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-01 21:49:06,848 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-01 21:49:06,849 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-01 21:49:06,850 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:49:06,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-01-01 21:49:06,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:06,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:06,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:06,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:06,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:06,853 INFO L794 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 565#L551 assume !(main_~length~0 < 1); 572#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 566#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 567#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 571#L556 assume !(main_~val~0 < 0); 580#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 570#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 561#L556 assume !(main_~val~0 < 0); 562#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 578#L554-3 assume !(main_~i~0 < main_~length~0); 575#L554-4 main_~j~0 := 0; 556#L561-3 assume !!(main_~j~0 < main_~length~0); 557#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 579#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 577#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 558#L561-3 assume !!(main_~j~0 < main_~length~0); 560#L562-3 [2019-01-01 21:49:06,854 INFO L796 eck$LassoCheckResult]: Loop: 560#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 573#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 560#L562-3 [2019-01-01 21:49:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-01-01 21:49:06,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:06,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-01-01 21:49:06,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:06,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-01-01 21:49:06,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:06,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:06,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:07,085 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:49:07,226 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 21:49:07,701 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-01-01 21:49:07,760 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:07,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:07,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:07,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:07,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:07,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:07,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:07,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:07,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:49:07,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:07,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:07,765 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-01 21:49:07,767 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-01 21:49:07,769 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-01 21:49:07,771 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-01 21:49:07,774 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-01 21:49:07,776 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-01 21:49:07,777 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-01 21:49:07,779 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-01 21:49:07,784 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-01 21:49:07,903 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-01 21:49:07,926 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-01 21:49:07,928 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-01 21:49:07,931 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-01 21:49:07,939 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-01 21:49:07,946 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-01 21:49:07,948 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-01 21:49:08,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:08,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:08,238 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-01 21:49:08,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:08,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:08,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:08,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,244 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-01 21:49:08,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,247 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-01 21:49:08,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,251 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-01 21:49:08,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:08,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:08,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:08,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,253 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-01 21:49:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,260 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-01 21:49:08,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:08,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:08,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:08,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,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-01 21:49:08,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:08,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:08,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:08,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,269 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-01 21:49:08,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,276 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-01 21:49:08,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,277 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:08,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,280 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:49:08,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,285 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-01 21:49:08,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,290 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-01 21:49:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,301 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-01 21:49:08,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,309 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-01 21:49:08,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,316 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-01 21:49:08,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:08,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:08,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:08,326 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-01 21:49:08,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:08,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:08,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:08,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:08,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:08,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:08,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:08,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:08,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:08,339 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:49:08,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:08,340 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:49:08,340 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:08,340 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2019-01-01 21:49:08,421 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:49:08,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:49:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,501 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-01 21:49:08,502 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-01 21:49:08,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:49:08,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:49:08,541 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-01 21:49:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:49:08,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 21:49:08,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:08,542 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,616 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-01 21:49:08,617 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-01 21:49:08,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:49:08,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:49:08,639 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-01 21:49:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:49:08,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 21:49:08,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:08,640 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,873 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-01 21:49:08,873 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-01 21:49:08,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:49:08,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-01-01 21:49:08,963 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-01 21:49:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-01 21:49:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 21:49:08,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-01-01 21:49:08,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:08,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-01 21:49:08,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:08,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-01-01 21:49:08,967 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:08,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-01-01 21:49:08,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:08,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:08,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:08,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:08,968 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:08,968 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:08,968 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:08,968 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:49:08,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:08,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:08,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:08,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:08 BoogieIcfgContainer [2019-01-01 21:49:08,980 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:08,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:08,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:08,980 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:08,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:59" (3/4) ... [2019-01-01 21:49:08,985 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:08,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:08,986 INFO L168 Benchmark]: Toolchain (without parser) took 10927.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 946.0 MB in the beginning and 813.0 MB in the end (delta: 133.0 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:08,987 INFO L168 Benchmark]: CDTParser took 0.18 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-01 21:49:08,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:08,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:08,991 INFO L168 Benchmark]: Boogie Preprocessor took 34.46 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-01 21:49:08,991 INFO L168 Benchmark]: RCFGBuilder took 480.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:08,993 INFO L168 Benchmark]: BuchiAutomizer took 9650.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 819.9 MB in the end (delta: 297.7 MB). Peak memory consumption was 368.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:08,994 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory was 819.9 MB in the beginning and 813.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:09,001 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.18 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 618.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.46 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 480.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9650.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 819.9 MB in the end (delta: 297.7 MB). Peak memory consumption was 368.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory was 819.9 MB in the beginning and 813.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 220 SDslu, 86 SDs, 0 SdLazy, 184 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax114 hnf98 lsp82 ukn80 mio100 lsp55 div100 bol100 ite100 ukn100 eq162 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...