./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array02-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/array02-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 2a421301cdbe97036a5fec0597ad83df33c3e561 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:47:18,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:18,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:18,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:18,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:18,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:18,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:18,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:18,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:18,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:18,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:18,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:18,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:18,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:18,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:18,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:18,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:18,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:18,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:18,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:18,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:18,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:18,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:18,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:18,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:18,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:18,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:18,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:18,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:18,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:18,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:18,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:18,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:18,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:18,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:18,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:18,301 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:47:18,327 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:18,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:18,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:18,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:18,332 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:18,332 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:18,332 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:18,332 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:18,332 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:18,333 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:18,333 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:18,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:18,333 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:18,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:18,335 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:18,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:18,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:18,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:18,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:18,336 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:18,337 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:18,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:18,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:18,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:18,338 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:18,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:18,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:18,338 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:18,341 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:18,341 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 -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2019-01-01 21:47:18,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:18,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:18,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:18,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:18,426 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:18,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2019-01-01 21:47:18,487 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4974bfe16/913782d586674052baacade3c8a5a490/FLAG5eb8ed02d [2019-01-01 21:47:18,984 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:18,985 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2019-01-01 21:47:18,999 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4974bfe16/913782d586674052baacade3c8a5a490/FLAG5eb8ed02d [2019-01-01 21:47:19,298 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4974bfe16/913782d586674052baacade3c8a5a490 [2019-01-01 21:47:19,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:19,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:19,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:19,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:19,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:19,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:19,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4388d87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19, skipping insertion in model container [2019-01-01 21:47:19,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:19,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:19,374 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:19,757 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:19,776 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:19,920 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:19,983 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:19,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19 WrapperNode [2019-01-01 21:47:19,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:19,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:19,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:19,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:19,994 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:47:19" (1/1) ... [2019-01-01 21:47:20,014 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:47:19" (1/1) ... [2019-01-01 21:47:20,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:20,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:20,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:20,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:20,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (1/1) ... [2019-01-01 21:47:20,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:20,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:20,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:20,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:20,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (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:47:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:20,532 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:20,533 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 21:47:20,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:20 BoogieIcfgContainer [2019-01-01 21:47:20,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:20,535 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:20,535 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:20,540 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:20,541 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:20,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:19" (1/3) ... [2019-01-01 21:47:20,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dc7ee46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:20, skipping insertion in model container [2019-01-01 21:47:20,543 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:20,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:19" (2/3) ... [2019-01-01 21:47:20,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dc7ee46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:20, skipping insertion in model container [2019-01-01 21:47:20,544 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:20,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:20" (3/3) ... [2019-01-01 21:47:20,548 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-termination.c.i [2019-01-01 21:47:20,616 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:20,617 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:20,617 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:20,617 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:20,617 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:20,618 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:20,618 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:20,618 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:20,618 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:20,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:47:20,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:20,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:20,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:20,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:20,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:20,664 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:20,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:47:20,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:20,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:20,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:20,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:20,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:20,678 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L565true assume !(main_~array_size~0 < 1); 9#L565-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 16#L552-3true [2019-01-01 21:47:20,680 INFO L796 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(test_fun_~i~0 < test_fun_~N); 13#L553-3true assume !true; 5#L557-2true assume !true; 14#L552-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 16#L552-3true [2019-01-01 21:47:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:47:20,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2019-01-01 21:47:20,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:20,861 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:47:20,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:47:20,867 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:20,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:47:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:47:20,885 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-01 21:47:20,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:20,892 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-01 21:47:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:47:20,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-01 21:47:20,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:20,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-01 21:47:20,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:47:20,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:47:20,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:47:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:20,904 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:47:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:47:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:47:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:47:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:47:20,938 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:47:20,938 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:47:20,938 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:20,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:47:20,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:20,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:20,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:20,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:20,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:47:20,941 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L565 assume !(main_~array_size~0 < 1); 39#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 40#L552-3 [2019-01-01 21:47:20,942 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 43#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 42#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L552-3 [2019-01-01 21:47:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-01 21:47:20,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2019-01-01 21:47:20,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2019-01-01 21:47:21,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:21,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:21,275 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 21:47:21,687 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-01 21:47:21,836 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:47:21,857 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:21,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:21,858 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:21,858 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:21,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:21,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:21,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:21,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:21,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:47:21,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:21,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:21,891 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:47:21,921 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:47:21,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:47:21,930 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:47:21,940 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:47:21,943 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:47:21,951 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:47:21,992 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:47:22,030 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:47:22,057 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:47:22,068 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:47:22,080 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:47:22,085 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:47:22,117 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:47:22,150 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:47:22,161 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:47:22,529 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:47:22,719 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:47:22,720 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:47:22,727 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:47:22,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:23,414 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:23,416 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:47:23,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,427 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:47:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,431 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:47:23,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,443 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:47:23,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,449 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:47:23,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,455 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:47:23,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,470 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:47:23,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,478 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:47:23,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,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:47:23,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,493 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:47:23,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,497 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:47:23,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,524 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:47:23,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,547 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:47:23,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,591 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:47:23,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:23,727 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:23,727 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:23,733 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:23,738 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:23,739 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:23,739 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-01-01 21:47:23,823 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:47:23,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:23,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:23,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:23,942 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:47:23,945 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:47:23,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:47:24,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2019-01-01 21:47:24,019 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:47:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-01 21:47:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:47:24,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:47:24,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:47:24,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-01 21:47:24,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:24,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2019-01-01 21:47:24,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:47:24,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:47:24,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 21:47:24,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:24,028 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:47:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 21:47:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 21:47:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:47:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-01 21:47:24,031 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:47:24,031 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:47:24,031 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:24,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-01 21:47:24,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:24,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:24,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:24,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:47:24,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:24,033 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 126#L565 assume !(main_~array_size~0 < 1); 128#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 129#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 132#L553-3 [2019-01-01 21:47:24,033 INFO L796 eck$LassoCheckResult]: Loop: 132#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 130#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 132#L553-3 [2019-01-01 21:47:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-01 21:47:24,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:24,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:24,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:24,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-01 21:47:24,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:24,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-01 21:47:24,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:24,409 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-01-01 21:47:24,498 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:24,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:24,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:24,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:24,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:24,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:24,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:24,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:24,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:47:24,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:24,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:24,507 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:47:24,510 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:47:24,512 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:47:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:24,534 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:47:24,537 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:47:24,539 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:47:24,541 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:47:24,546 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:47:24,559 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:47:24,562 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:47:24,566 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:47:24,572 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:47:24,713 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:47:24,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:24,720 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:47:24,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:47:24,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:47:24,729 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:47:25,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:25,234 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:25,235 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:47:25,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,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:47:25,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,241 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:47:25,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,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:47:25,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,246 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:47:25,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,252 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:47:25,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,254 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:47:25,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,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:47:25,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,263 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:47:25,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,265 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:47:25,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,268 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:47:25,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,273 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:47:25,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,278 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:47:25,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,288 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:47:25,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,294 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:47:25,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:25,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,314 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:47:25,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,315 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:47:25,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,318 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:47:25,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:25,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:25,329 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:47:25,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:25,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:25,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:25,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:25,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:25,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:25,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:25,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:25,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:25,334 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:25,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:25,335 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:47:25,335 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:25,335 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-01-01 21:47:25,419 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:47:25,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:25,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:25,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:25,572 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:47:25,573 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:47:25,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:47:25,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2019-01-01 21:47:25,767 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:47:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:47:25,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:47:25,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:25,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:47:25,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:25,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:47:25,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:25,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-01 21:47:25,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:25,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2019-01-01 21:47:25,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:47:25,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:47:25,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-01-01 21:47:25,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:25,773 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-01 21:47:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-01-01 21:47:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-01 21:47:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:47:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-01 21:47:25,778 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-01 21:47:25,778 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-01 21:47:25,778 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:47:25,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-01 21:47:25,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:25,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:25,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:25,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:25,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:25,782 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 230#L565 assume !(main_~array_size~0 < 1); 232#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 233#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 247#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 234#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 235#L557-2 [2019-01-01 21:47:25,783 INFO L796 eck$LassoCheckResult]: Loop: 235#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 238#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 235#L557-2 [2019-01-01 21:47:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-01-01 21:47:25,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:25,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:25,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:25,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2019-01-01 21:47:25,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:25,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2019-01-01 21:47:25,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:25,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:25,933 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 21:47:26,193 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-01 21:47:26,259 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:26,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:26,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:26,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:26,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:26,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:26,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:26,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:26,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:47:26,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:26,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:26,264 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:47:26,272 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:47:26,313 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:47:26,316 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:47:26,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:26,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:26,330 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:47:26,332 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:47:26,335 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:47:26,338 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:47:26,340 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:47:26,343 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:47:26,347 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:47:26,350 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:47:26,354 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:47:26,357 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:47:26,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:26,497 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 21:47:26,628 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-01 21:47:26,629 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:47:26,632 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:47:27,027 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:47:27,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:27,111 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:27,111 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:47:27,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,118 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:47:27,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,126 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:47:27,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,135 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:47:27,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,137 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:47:27,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,145 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:47:27,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,155 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:47:27,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,163 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:47:27,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,170 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:47:27,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,178 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:47:27,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:27,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,192 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:47:27,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,206 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:47:27,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,214 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:47:27,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,221 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:47:27,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,226 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:47:27,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:27,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:27,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:27,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:27,235 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:47:27,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:27,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:27,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:27,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:27,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:27,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:27,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:27,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:27,254 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:27,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:27,256 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:27,257 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:27,257 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2019-01-01 21:47:27,283 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:47:27,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:27,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:27,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:27,348 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:47:27,349 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:47:27,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 21:47:27,439 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-01-01 21:47:27,440 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:47:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:47:27,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:47:27,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:27,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:47:27,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:27,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:47:27,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:27,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-01-01 21:47:27,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:27,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2019-01-01 21:47:27,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:47:27,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:47:27,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-01-01 21:47:27,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:27,449 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 21:47:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-01-01 21:47:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 21:47:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:47:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-01-01 21:47:27,454 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-01 21:47:27,454 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-01 21:47:27,455 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:47:27,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-01-01 21:47:27,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:47:27,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:27,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:27,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:27,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:27,459 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 349#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 350#L565 assume !(main_~array_size~0 < 1); 352#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 353#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 358#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 368#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 360#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 361#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 362#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L553-3 [2019-01-01 21:47:27,459 INFO L796 eck$LassoCheckResult]: Loop: 356#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 354#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 356#L553-3 [2019-01-01 21:47:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2019-01-01 21:47:27,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:27,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:27,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-01 21:47:27,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:27,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2019-01-01 21:47:27,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:27,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:27,829 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-01 21:47:27,893 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:27,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:27,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:27,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:27,894 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:27,894 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:27,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:27,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:27,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:47:27,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:27,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:27,899 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:47:27,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:47:27,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:47:27,930 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:47:27,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:47:27,932 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:47:27,934 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:47:27,941 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:47:27,943 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:47:27,945 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:47:27,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:47:27,949 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:47:27,952 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:47:27,953 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:47:27,955 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:47:27,957 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:47:27,959 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:47:27,960 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:47:27,962 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:47:28,096 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 21:47:28,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:28,656 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:28,656 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:47:28,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,666 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:47:28,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,673 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:47:28,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,682 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:47:28,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,690 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:47:28,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,694 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:47:28,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,700 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:47:28,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,708 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:47:28,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,715 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:47:28,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:28,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,731 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:47:28,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,744 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:47:28,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,754 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:47:28,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,758 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:47:28,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,761 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:47:28,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,764 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:47:28,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,767 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:47:28,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,775 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:47:28,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,783 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:47:28,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,801 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:47:28,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:47:28,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,806 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:47:28,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,816 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:47:28,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:28,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:28,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:28,827 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:47:28,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:28,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:28,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:28,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:28,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:28,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:28,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:28,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:28,838 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:28,838 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:28,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:28,839 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:47:28,840 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:28,840 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2019-01-01 21:47:28,947 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:47:28,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,078 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:47:29,079 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:47:29,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 21:47:29,160 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-01-01 21:47:29,162 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:47:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:47:29,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:47:29,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:29,163 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,229 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:47:29,229 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:47:29,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 21:47:29,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-01-01 21:47:29,304 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:47:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:47:29,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:47:29,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:29,305 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:29,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:29,365 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:47:29,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 21:47:29,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2019-01-01 21:47:29,489 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:47:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-01 21:47:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:47:29,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:29,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:47:29,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:29,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 21:47:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:29,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-01-01 21:47:29,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:29,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2019-01-01 21:47:29,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:47:29,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:47:29,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-01-01 21:47:29,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:29,497 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-01 21:47:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-01-01 21:47:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-01 21:47:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:47:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-01 21:47:29,501 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-01 21:47:29,501 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-01 21:47:29,501 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:47:29,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-01 21:47:29,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:29,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:29,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:29,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:29,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:29,503 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 648#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 649#L565 assume !(main_~array_size~0 < 1); 651#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 652#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 662#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 663#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 659#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 665#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 666#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 660#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 653#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 654#L557-2 [2019-01-01 21:47:29,503 INFO L796 eck$LassoCheckResult]: Loop: 654#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 657#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 654#L557-2 [2019-01-01 21:47:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2019-01-01 21:47:29,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:29,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2019-01-01 21:47:29,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2019-01-01 21:47:29,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:29,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:29,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:29,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:29,858 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-01-01 21:47:29,929 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:29,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:29,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:29,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:29,930 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:29,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:29,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:29,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:29,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:47:29,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:29,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:29,936 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:47:29,940 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:47:29,942 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:47:29,943 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:47:29,945 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:47:29,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:47:29,947 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:47:29,951 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:47:29,954 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:47:29,957 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:47:29,961 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:47:29,963 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:47:29,965 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:47:29,969 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:47:29,971 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:47:29,975 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:47:29,978 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:47:30,144 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-01 21:47:30,201 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:47:30,204 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:47:30,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:30,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:30,790 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:47:30,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,801 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:47:30,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,813 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:47:30,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,828 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:47:30,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,830 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:47:30,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,862 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:47:30,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,882 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:47:30,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,892 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:47:30,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,897 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:47:30,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:30,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:30,952 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:30,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:30,954 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:30,954 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:30,954 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4 Supporting invariants [] [2019-01-01 21:47:31,139 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-01 21:47:31,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:31,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:31,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:31,630 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:47:31,631 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:47:31,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:47:31,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-01-01 21:47:31,788 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:47:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:47:31,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:47:31,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:31,789 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:32,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:32,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:32,281 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:47:32,282 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:47:32,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:47:32,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-01-01 21:47:32,412 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:47:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:47:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:47:32,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,413 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:32,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:32,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:32,710 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:47:32,710 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:47:32,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:47:32,729 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2019-01-01 21:47:32,731 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:47:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 21:47:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:47:32,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-01 21:47:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-01 21:47:32,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 21:47:32,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:32,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-01 21:47:32,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:32,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:32,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:32,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:32,741 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:32,742 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:32,742 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:32,742 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:47:32,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:32,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:32,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:32,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:32 BoogieIcfgContainer [2019-01-01 21:47:32,750 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:32,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:32,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:32,751 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:32,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:20" (3/4) ... [2019-01-01 21:47:32,756 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:32,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:32,757 INFO L168 Benchmark]: Toolchain (without parser) took 13455.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:32,758 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:32,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:32,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.69 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:47:32,760 INFO L168 Benchmark]: Boogie Preprocessor took 42.04 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:47:32,761 INFO L168 Benchmark]: RCFGBuilder took 447.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:32,761 INFO L168 Benchmark]: BuchiAutomizer took 12215.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 204.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:32,762 INFO L168 Benchmark]: Witness Printer took 5.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:32,767 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.04 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 447.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12215.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 204.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.1s. Construction of modules took 0.7s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax111 hnf99 lsp79 ukn78 mio100 lsp52 div100 bol100 ite100 ukn100 eq179 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...