./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:18:41,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:18:41,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:18:41,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:18:41,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:18:41,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:18:41,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:18:41,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:18:41,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:18:41,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:18:41,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:18:41,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:18:41,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:18:41,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:18:41,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:18:41,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:18:41,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:18:41,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:18:41,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:18:41,424 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:18:41,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:18:41,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:18:41,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:18:41,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:18:41,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:18:41,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:18:41,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:18:41,431 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:18:41,432 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:18:41,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:18:41,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:18:41,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:18:41,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:18:41,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:18:41,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:18:41,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:18:41,436 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:18:41,454 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:18:41,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:18:41,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:18:41,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:18:41,457 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:18:41,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:18:41,457 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:18:41,457 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:18:41,460 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:18:41,460 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:18:41,460 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:18:41,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:18:41,460 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:18:41,461 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:18:41,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:18:41,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:18:41,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:18:41,462 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:18:41,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:18:41,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:18:41,462 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:18:41,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:18:41,463 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:18:41,463 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:18:41,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:18:41,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:18:41,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:18:41,467 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:18:41,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:18:41,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:18:41,468 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:18:41,469 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:18:41,469 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2019-01-02 00:18:41,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:18:41,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:18:41,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:18:41,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:18:41,540 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:18:41,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:41,601 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb47d209a/cc0a5a0857d24307bc3c22859ccffcd1/FLAG3a746d332 [2019-01-02 00:18:42,211 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:18:42,212 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:42,234 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb47d209a/cc0a5a0857d24307bc3c22859ccffcd1/FLAG3a746d332 [2019-01-02 00:18:42,433 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb47d209a/cc0a5a0857d24307bc3c22859ccffcd1 [2019-01-02 00:18:42,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:18:42,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:18:42,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:42,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:18:42,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:18:42,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:42" (1/1) ... [2019-01-02 00:18:42,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59db9926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:42, skipping insertion in model container [2019-01-02 00:18:42,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:42" (1/1) ... [2019-01-02 00:18:42,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:18:42,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:18:42,850 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:42,862 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:18:42,940 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:43,065 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:18:43,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43 WrapperNode [2019-01-02 00:18:43,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:43,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:43,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:18:43,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:18:43,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:43,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:18:43,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:18:43,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:18:43,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (1/1) ... [2019-01-02 00:18:43,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:18:43,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:18:43,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:18:43,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:18:43,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (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-02 00:18:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:18:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:18:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:18:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:18:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:18:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:18:43,571 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:18:43,572 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-02 00:18:43,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:43 BoogieIcfgContainer [2019-01-02 00:18:43,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:18:43,573 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:18:43,573 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:18:43,577 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:18:43,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:43,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:18:42" (1/3) ... [2019-01-02 00:18:43,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b0a60ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:43, skipping insertion in model container [2019-01-02 00:18:43,579 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:43,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:43" (2/3) ... [2019-01-02 00:18:43,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b0a60ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:43, skipping insertion in model container [2019-01-02 00:18:43,580 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:43,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:43" (3/3) ... [2019-01-02 00:18:43,582 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:43,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:18:43,648 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:18:43,648 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:18:43,648 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:18:43,649 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:18:43,649 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:18:43,649 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:18:43,649 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:18:43,649 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:18:43,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-02 00:18:43,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:18:43,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:43,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:43,694 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:18:43,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:18:43,695 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:18:43,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-02 00:18:43,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:18:43,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:43,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:43,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:18:43,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:18:43,704 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-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; 11#L545-3true [2019-01-02 00:18:43,705 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2019-01-02 00:18:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:43,712 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-02 00:18:43,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:43,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:43,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2019-01-02 00:18:43,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:43,868 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-02 00:18:43,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:18:43,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:18:43,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:18:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:18:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:18:43,894 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-02 00:18:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:43,902 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-02 00:18:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:18:43,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-02 00:18:43,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:18:43,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-02 00:18:43,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:18:43,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:18:43,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-02 00:18:43,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:43,912 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:18:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-02 00:18:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-02 00:18:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-02 00:18:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-02 00:18:43,942 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:18:43,942 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:18:43,942 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:18:43,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-02 00:18:43,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:18:43,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:43,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:43,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:18:43,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:18:43,944 INFO L794 eck$LassoCheckResult]: Stem: 43#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-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; 41#L545-3 [2019-01-02 00:18:43,945 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2019-01-02 00:18:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-02 00:18:43,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:43,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2019-01-02 00:18:43,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:43,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2019-01-02 00:18:43,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:43,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:43,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:44,189 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:18:44,559 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-02 00:18:44,676 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-02 00:18:44,695 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:44,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:44,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:44,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:44,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:44,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:44,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:44,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:44,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:18:44,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:44,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:44,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-02 00:18:44,752 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-02 00:18:44,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:44,802 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-02 00:18:44,834 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-02 00:18:44,838 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-02 00:18:44,844 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-02 00:18:44,850 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-02 00:18:44,855 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-02 00:18:44,860 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-02 00:18:44,878 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-02 00:18:44,880 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-02 00:18:44,886 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-02 00:18:44,888 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-02 00:18:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:45,411 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-02 00:18:45,468 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-02 00:18:45,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:45,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:45,974 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-02 00:18:45,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:45,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:45,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:45,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:45,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:45,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:45,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:45,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:45,984 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-02 00:18:45,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:45,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:45,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:45,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:45,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:45,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:45,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:45,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:45,987 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-02 00:18:45,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:45,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:45,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:45,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:45,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:45,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:45,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:45,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:45,991 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-02 00:18:45,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:45,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:45,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:45,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:45,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:45,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,000 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-02 00:18:46,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,004 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-02 00:18:46,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,007 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-02 00:18:46,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:46,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,015 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-02 00:18:46,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,018 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-02 00:18:46,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,021 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-02 00:18:46,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:46,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,028 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-02 00:18:46,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,032 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-02 00:18:46,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,035 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-02 00:18:46,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:46,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,042 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-02 00:18:46,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,045 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-02 00:18:46,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:46,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:46,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:46,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,049 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-02 00:18:46,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:46,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:46,072 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-02 00:18:46,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:46,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:46,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:46,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:46,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:46,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:46,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:46,234 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:18:46,234 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:18:46,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:46,239 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:46,239 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:46,240 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-02 00:18:46,302 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:18:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:46,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:46,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:46,406 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-02 00:18:46,410 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-02 00:18:46,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-02 00:18:46,474 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-02 00:18:46,476 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-02 00:18:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-02 00:18:46,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-02 00:18:46,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:46,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-02 00:18:46,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:46,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-02 00:18:46,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:46,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-02 00:18:46,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:46,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2019-01-02 00:18:46,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:18:46,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:18:46,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-02 00:18:46,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:18:46,485 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-02 00:18:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-02 00:18:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-02 00:18:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-02 00:18:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-02 00:18:46,487 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-02 00:18:46,487 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-02 00:18:46,487 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:18:46,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-02 00:18:46,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:46,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:46,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:46,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:18:46,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:46,489 INFO L794 eck$LassoCheckResult]: Stem: 136#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-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; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2019-01-02 00:18:46,489 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-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~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 133#L546-3 [2019-01-02 00:18:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-02 00:18:46,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:46,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-02 00:18:46,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:46,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-02 00:18:46,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:46,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:46,720 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:18:46,957 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-02 00:18:47,038 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:47,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:47,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:47,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:47,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:47,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:47,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:47,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:47,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:18:47,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:47,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:47,045 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-02 00:18:47,058 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-02 00:18:47,065 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-02 00:18:47,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-02 00:18:47,071 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-02 00:18:47,075 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-02 00:18:47,077 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-02 00:18:47,078 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-02 00:18:47,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-02 00:18:47,083 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-02 00:18:47,093 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-02 00:18:47,096 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-02 00:18:47,224 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-02 00:18:47,244 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-02 00:18:47,246 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-02 00:18:47,249 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-02 00:18:47,251 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-02 00:18:47,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:47,646 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:47,646 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-02 00:18:47,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,649 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-02 00:18:47,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,652 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-02 00:18:47,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,676 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-02 00:18:47,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,679 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-02 00:18:47,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,683 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-02 00:18:47,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,685 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-02 00:18:47,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,688 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-02 00:18:47,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,695 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-02 00:18:47,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,697 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-02 00:18:47,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,710 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-02 00:18:47,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,720 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-02 00:18:47,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,734 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-02 00:18:47,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,741 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-02 00:18:47,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:47,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,768 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-02 00:18:47,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,772 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:18:47,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,774 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:18:47,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:47,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:47,794 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-02 00:18:47,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:47,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:47,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:47,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:47,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:47,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:47,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:47,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:47,804 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:18:47,806 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:18:47,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:47,807 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:18:47,807 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:47,807 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-02 00:18:47,861 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:18:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:18:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:47,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:47,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:48,053 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-02 00:18:48,054 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-02 00:18:48,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-02 00:18:48,178 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-02 00:18:48,180 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-02 00:18:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-02 00:18:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:18:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:18:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:18:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-02 00:18:48,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:48,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2019-01-02 00:18:48,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-02 00:18:48,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:18:48,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-01-02 00:18:48,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:18:48,185 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-02 00:18:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-01-02 00:18:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-02 00:18:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:18:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-02 00:18:48,189 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:18:48,189 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:18:48,189 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:18:48,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-02 00:18:48,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:48,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:48,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:48,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:48,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:48,191 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#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; 234#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-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; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2019-01-02 00:18:48,193 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 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~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 229#L550-2 [2019-01-02 00:18:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-01-02 00:18:48,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:48,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:48,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2019-01-02 00:18:48,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2019-01-02 00:18:48,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:48,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:48,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:48,474 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:18:48,656 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-02 00:18:49,009 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-02 00:18:49,075 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:49,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:49,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:49,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:49,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:49,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:49,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:49,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:49,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:18:49,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:49,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:49,081 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-02 00:18:49,087 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-02 00:18:49,091 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-02 00:18:49,093 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-02 00:18:49,095 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-02 00:18:49,097 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-02 00:18:49,105 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-02 00:18:49,106 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-02 00:18:49,118 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-02 00:18:49,121 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-02 00:18:49,122 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-02 00:18:49,138 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-02 00:18:49,140 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-02 00:18:49,142 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-02 00:18:49,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:49,367 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:18:49,412 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-02 00:18:49,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:49,810 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:49,810 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-02 00:18:49,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,817 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-02 00:18:49,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:49,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:49,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,823 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-02 00:18:49,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:49,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:49,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,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-02 00:18:49,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:49,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,840 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-02 00:18:49,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,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-02 00:18:49,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:49,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:49,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:49,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,858 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-02 00:18:49,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,863 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-02 00:18:49,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,868 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-02 00:18:49,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:49,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:49,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,879 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-02 00:18:49,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,881 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-02 00:18:49,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,889 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-02 00:18:49,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:49,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:49,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:49,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:49,896 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-02 00:18:49,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:49,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:49,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:49,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:49,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:49,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:49,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:49,920 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:18:49,921 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:18:49,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:49,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:49,923 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:49,923 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))_3) = 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))_3 Supporting invariants [] [2019-01-02 00:18:50,030 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:18:50,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:18:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:50,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:50,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:50,089 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-02 00:18:50,090 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-02 00:18:50,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-02 00:18:50,123 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-02 00:18:50,125 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-02 00:18:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:18:50,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:18:50,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:50,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:18:50,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:50,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-02 00:18:50,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:50,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-01-02 00:18:50,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:50,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2019-01-02 00:18:50,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:18:50,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-02 00:18:50,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-01-02 00:18:50,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:18:50,131 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-02 00:18:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-01-02 00:18:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-02 00:18:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-02 00:18:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-01-02 00:18:50,135 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-02 00:18:50,135 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-02 00:18:50,135 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:18:50,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-01-02 00:18:50,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:18:50,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:50,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:50,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:50,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:50,137 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#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; 354#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-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; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2019-01-02 00:18:50,137 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-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~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 359#L546-3 [2019-01-02 00:18:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2019-01-02 00:18:50,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:50,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-02 00:18:50,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:50,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:50,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:50,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2019-01-02 00:18:50,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:50,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:50,325 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:18:50,528 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-02 00:18:50,675 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-02 00:18:50,678 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:50,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:50,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:50,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:50,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:50,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:50,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:50,679 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:50,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-02 00:18:50,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:50,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:50,684 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-02 00:18:50,688 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-02 00:18:50,690 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-02 00:18:50,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:50,695 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-02 00:18:50,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:50,699 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-02 00:18:50,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:50,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:50,709 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-02 00:18:50,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-02 00:18:50,715 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-02 00:18:50,717 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-02 00:18:50,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-02 00:18:50,730 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-02 00:18:50,731 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-02 00:18:50,894 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-02 00:18:51,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:51,442 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:51,442 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-02 00:18:51,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:51,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,462 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-02 00:18:51,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,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-02 00:18:51,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,475 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-02 00:18:51,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,480 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-02 00:18:51,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,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-02 00:18:51,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,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-02 00:18:51,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,499 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-02 00:18:51,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,505 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-02 00:18:51,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,522 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-02 00:18:51,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,529 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-02 00:18:51,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,535 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-02 00:18:51,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,537 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-02 00:18:51,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,541 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-02 00:18:51,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,549 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-02 00:18:51,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,562 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-02 00:18:51,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,563 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:18:51,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,569 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:18:51,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,586 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-02 00:18:51,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:51,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:51,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:51,594 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-02 00:18:51,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:51,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:51,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:51,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:51,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:51,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:51,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:51,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:51,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:18:51,603 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:18:51,603 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:51,603 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:18:51,603 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:51,604 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-02 00:18:51,707 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:18:51,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:18:51,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:51,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:52,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,168 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-02 00:18:52,168 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-02 00:18:52,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-02 00:18:52,432 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-02 00:18:52,433 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-02 00:18:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-02 00:18:52,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-02 00:18:52,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:52,434 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:18:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:52,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:52,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,846 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-02 00:18:52,846 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-02 00:18:52,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-02 00:18:52,879 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-02 00:18:52,881 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-02 00:18:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-02 00:18:52,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-02 00:18:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:52,882 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:18:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:52,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:52,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:52,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-02 00:18:52,943 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-02 00:18:52,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-02 00:18:53,231 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-02 00:18:53,232 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-02 00:18:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-02 00:18:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-02 00:18:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-02 00:18:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-02 00:18:53,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:53,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-01-02 00:18:53,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:18:53,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2019-01-02 00:18:53,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:18:53,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:18:53,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-01-02 00:18:53,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:18:53,238 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-02 00:18:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-01-02 00:18:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-02 00:18:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:18:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-02 00:18:53,243 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-02 00:18:53,243 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-02 00:18:53,243 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:18:53,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-02 00:18:53,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:18:53,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:53,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:53,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:53,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:53,246 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#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; 653#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-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; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2019-01-02 00:18:53,246 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 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~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 648#L550-2 [2019-01-02 00:18:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2019-01-02 00:18:53,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2019-01-02 00:18:53,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2019-01-02 00:18:53,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:53,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:53,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:53,570 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-01-02 00:18:53,640 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:53,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:53,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:53,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:53,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:53,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:53,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:53,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:53,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-02 00:18:53,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:53,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:53,645 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-02 00:18:53,686 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-02 00:18:53,709 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-02 00:18:53,723 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-02 00:18:53,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:53,739 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-02 00:18:53,741 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-02 00:18:53,743 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-02 00:18:53,747 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-02 00:18:53,748 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-02 00:18:53,749 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-02 00:18:53,751 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-02 00:18:53,752 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-02 00:18:53,754 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-02 00:18:53,756 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-02 00:18:53,955 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-02 00:18:54,038 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-02 00:18:54,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:54,390 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:54,390 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-02 00:18:54,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:54,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,405 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-02 00:18:54,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:54,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,414 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-02 00:18:54,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,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-02 00:18:54,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,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-02 00:18:54,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,433 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-02 00:18:54,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,438 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-02 00:18:54,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,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-02 00:18:54,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,444 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-02 00:18:54,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,450 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-02 00:18:54,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,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-02 00:18:54,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,461 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-02 00:18:54,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:54,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:54,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:54,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,462 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-02 00:18:54,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:54,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-02 00:18:54,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:54,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:54,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:54,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:54,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:54,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:54,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:54,501 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:18:54,502 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:18:54,502 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:54,507 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:54,507 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:54,507 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-02 00:18:54,663 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-02 00:18:54,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:18:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,751 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-02 00:18:54,752 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-02 00:18:54,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:18:54,777 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-02 00:18:54,779 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-02 00:18:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:18:54,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-02 00:18:54,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:54,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:18:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,821 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-02 00:18:54,821 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-02 00:18:54,821 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:18:54,838 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-02 00:18:54,839 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-02 00:18:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:18:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-02 00:18:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:54,842 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:18:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:54,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:54,884 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-02 00:18:54,885 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-02 00:18:54,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:18:54,906 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-02 00:18:54,907 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-02 00:18:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-02 00:18:54,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-02 00:18:54,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:54,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-02 00:18:54,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:54,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-02 00:18:54,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:54,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-02 00:18:54,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:54,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-02 00:18:54,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:18:54,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:18:54,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:18:54,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:54,911 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:54,911 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:54,911 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:54,911 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:18:54,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:18:54,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:54,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:18:54,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:18:54 BoogieIcfgContainer [2019-01-02 00:18:54,918 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:18:54,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:18:54,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:18:54,919 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:18:54,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:43" (3/4) ... [2019-01-02 00:18:54,923 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:18:54,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:18:54,924 INFO L168 Benchmark]: Toolchain (without parser) took 12486.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:54,925 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:54,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:54,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.60 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:54,927 INFO L168 Benchmark]: Boogie Preprocessor took 32.43 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-02 00:18:54,928 INFO L168 Benchmark]: RCFGBuilder took 424.01 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:54,929 INFO L168 Benchmark]: BuchiAutomizer took 11345.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:54,930 INFO L168 Benchmark]: Witness Printer took 4.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:54,934 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.60 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.43 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 424.01 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11345.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.60 ms. Allocated memory is still 1.3 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][4 * i + a] 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 11.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.7s. Construction of modules took 0.7s. Büchi inclusion checks took 1.6s. 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: inital155 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp53 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms 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...