./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-14 04:56:44,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:56:44,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:56:44,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:56:44,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:56:44,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:56:44,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:56:44,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:56:44,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:56:44,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:56:44,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:56:44,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:56:44,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:56:44,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:56:44,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:56:44,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:56:44,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:56:44,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:56:44,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:56:44,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:56:44,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:56:44,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:56:44,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:56:44,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:56:44,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:56:44,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:56:44,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:56:44,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:56:44,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:56:44,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:56:44,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:56:44,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:56:44,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:56:44,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:56:44,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:56:44,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:56:44,415 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:56:44,431 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:56:44,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:56:44,433 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:56:44,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:56:44,433 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:56:44,433 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:56:44,434 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:56:44,434 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:56:44,434 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:56:44,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:56:44,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:56:44,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:56:44,435 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:56:44,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:56:44,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:56:44,437 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:56:44,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:56:44,438 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:56:44,439 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:56:44,439 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:56:44,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:56:44,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:56:44,439 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:56:44,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:56:44,441 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:56:44,441 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:56:44,442 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:56:44,442 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-14 04:56:44,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:56:44,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:56:44,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:56:44,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:56:44,502 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:56:44,503 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-14 04:56:44,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa816b949/d2d494fbc7bb46aea23af607dabccd04/FLAG56e882d1b [2019-01-14 04:56:45,074 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:56:45,075 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:45,089 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa816b949/d2d494fbc7bb46aea23af607dabccd04/FLAG56e882d1b [2019-01-14 04:56:45,397 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa816b949/d2d494fbc7bb46aea23af607dabccd04 [2019-01-14 04:56:45,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:56:45,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:56:45,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:45,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:56:45,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:56:45,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:45" (1/1) ... [2019-01-14 04:56:45,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c59de3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:45, skipping insertion in model container [2019-01-14 04:56:45,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:45" (1/1) ... [2019-01-14 04:56:45,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:56:45,474 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:56:45,839 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:45,853 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:56:46,007 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:46,058 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:56:46,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46 WrapperNode [2019-01-14 04:56:46,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:46,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:46,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:56:46,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:56:46,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:46,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:56:46,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:56:46,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:56:46,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:56:46,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:56:46,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:56:46,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:56:46,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:56:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:56:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:56:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:56:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:56:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:56:46,572 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:56:46,573 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 04:56:46,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46 BoogieIcfgContainer [2019-01-14 04:56:46,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:56:46,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:56:46,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:56:46,579 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:56:46,580 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:56:45" (1/3) ... [2019-01-14 04:56:46,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@611cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:46, skipping insertion in model container [2019-01-14 04:56:46,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (2/3) ... [2019-01-14 04:56:46,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@611cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:46, skipping insertion in model container [2019-01-14 04:56:46,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46" (3/3) ... [2019-01-14 04:56:46,586 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:46,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:56:46,651 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:56:46,651 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:56:46,651 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:56:46,652 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:56:46,652 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:56:46,652 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:56:46,652 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:56:46,652 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:56:46,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:56:46,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:56:46,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,691 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:46,692 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:56:46,692 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:56:46,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:56:46,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:56:46,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,694 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:46,694 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:56:46,701 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-14 04:56:46,702 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-14 04:56:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:56:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2019-01-14 04:56:46,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:46,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:46,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:56:46,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:56:46,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:56:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:56:46,885 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 04:56:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:46,891 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 04:56:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:56:46,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 04:56:46,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:56:46,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-14 04:56:46,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:56:46,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:56:46,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 04:56:46,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:46,904 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:56:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 04:56:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 04:56:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:56:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 04:56:46,936 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:56:46,936 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:56:46,936 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:56:46,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 04:56:46,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:56:46,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,938 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:46,938 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:56:46,939 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-14 04:56:46,940 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-14 04:56:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:56:46,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2019-01-14 04:56:46,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2019-01-14 04:56:46,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,357 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:56:47,465 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 04:56:47,821 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 04:56:47,923 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:56:47,934 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:47,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:47,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:47,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:47,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:47,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:47,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:47,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:47,937 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:56:47,937 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:47,937 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:47,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:47,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,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-14 04:56:48,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-14 04:56:48,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,677 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:56:48,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:49,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:49,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:49,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:49,545 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:56:49,551 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:56:49,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:49,558 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:49,560 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:49,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-01-14 04:56:49,648 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:49,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:49,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:56:49,878 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-14 04:56:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-14 04:56:49,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 04:56:49,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 04:56:49,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-14 04:56:49,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-14 04:56:49,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:49,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2019-01-14 04:56:49,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:56:49,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:56:49,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-14 04:56:49,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:49,887 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 04:56:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-14 04:56:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 04:56:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 04:56:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-14 04:56:49,889 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 04:56:49,890 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 04:56:49,890 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:56:49,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-14 04:56:49,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:49,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:49,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:49,891 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:56:49,891 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:49,892 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-14 04:56:49,892 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-14 04:56:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 04:56:49,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-14 04:56:49,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:49,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-14 04:56:49,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:50,262 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-14 04:56:50,345 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:50,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:50,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:50,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:50,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:50,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:50,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:50,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:50,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:56:50,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:50,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:50,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,533 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:56:50,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:50,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:50,992 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:50,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:50,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:50,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:50,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:50,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:50,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:50,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:50,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:50,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:50,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,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-14 04:56:51,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,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-14 04:56:51,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,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-14 04:56:51,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,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-14 04:56:51,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:51,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,109 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:51,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,113 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:51,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:51,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:51,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:51,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:51,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:51,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:51,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:51,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:51,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:51,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:51,129 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:51,133 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:51,136 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:51,136 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:51,136 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:56:51,137 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:51,137 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-01-14 04:56:51,221 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:51,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:51,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:51,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:51,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:51,635 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 04:56:51,754 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-14 04:56:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:56:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:56:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:56:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:56:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:51,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-14 04:56:51,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:51,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2019-01-14 04:56:51,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 04:56:51,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:56:51,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-01-14 04:56:51,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:51,762 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-14 04:56:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-01-14 04:56:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-14 04:56:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:56:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-14 04:56:51,765 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 04:56:51,765 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 04:56:51,765 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:56:51,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-14 04:56:51,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:51,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:51,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:51,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:51,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:51,769 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-14 04:56:51,769 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~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 229#L550-2 [2019-01-14 04:56:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-01-14 04:56:51,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:51,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2019-01-14 04:56:51,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2019-01-14 04:56:51,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,919 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:56:52,221 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-14 04:56:52,290 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:52,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:52,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:52,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:52,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:52,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:52,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:52,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:52,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:56:52,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:52,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:52,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,588 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-14 04:56:52,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:53,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:53,041 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:53,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-14 04:56:53,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:53,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:53,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:53,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:53,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,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-14 04:56:53,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:53,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:53,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:53,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:53,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:53,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:53,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:53,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:53,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:53,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:53,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:53,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:53,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:53,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:53,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:53,152 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:53,163 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:56:53,163 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:56:53,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:53,164 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:53,166 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:53,166 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-14 04:56:53,194 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:56:53,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:53,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:53,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:53,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:53,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 04:56:53,295 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-14 04:56:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:56:53,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:56:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:56:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 04:56:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-01-14 04:56:53,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:53,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2019-01-14 04:56:53,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:56:53,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:53,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-01-14 04:56:53,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:53,302 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-14 04:56:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-01-14 04:56:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 04:56:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 04:56:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-01-14 04:56:53,306 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-14 04:56:53,306 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-14 04:56:53,306 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:56:53,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-01-14 04:56:53,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:53,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:53,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:53,308 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:53,308 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:53,309 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-14 04:56:53,309 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-14 04:56:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2019-01-14 04:56:53,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-14 04:56:53,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2019-01-14 04:56:53,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,574 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:56:53,851 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-14 04:56:54,014 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 04:56:54,016 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:54,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:54,016 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:54,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:54,016 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:54,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:54,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:54,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:54,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:56:54,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:54,017 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:54,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,301 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-14 04:56:54,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:54,674 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:54,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,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-14 04:56:54,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,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-14 04:56:54,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,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-14 04:56:54,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,780 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:54,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:54,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:54,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:54,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:54,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:54,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:54,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:54,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:54,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:54,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:54,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:54,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:54,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:54,809 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:54,813 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:54,813 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:54,813 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:56:54,814 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:54,814 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-14 04:56:54,916 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:56:54,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:55,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:55,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:55,682 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-14 04:56:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:56:55,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:56:55,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,685 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:56,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:56,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:56,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:56,387 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-14 04:56:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:56:56,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:56:56,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,390 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:56,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:56,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:56,497 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:56,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:56,691 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-14 04:56:56,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 04:56:56,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:56:56,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 04:56:56,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 04:56:56,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-01-14 04:56:56,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:56,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2019-01-14 04:56:56,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:56:56,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:56:56,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-01-14 04:56:56,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:56,700 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-14 04:56:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-01-14 04:56:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-14 04:56:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:56:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-14 04:56:56,703 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 04:56:56,703 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 04:56:56,703 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:56:56,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-14 04:56:56,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:56,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:56,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:56,705 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:56,705 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:56,705 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-14 04:56:56,705 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~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 648#L550-2 [2019-01-14 04:56:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2019-01-14 04:56:56,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2019-01-14 04:56:56,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2019-01-14 04:56:56,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,942 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:56:57,105 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:56:57,516 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-01-14 04:56:57,588 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:57,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:57,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:57,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:57,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:57,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:57,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:57,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:57,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-14 04:56:57,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:57,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:57,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:57,852 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-14 04:56:57,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:58,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:58,256 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:58,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:58,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:58,369 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:58,369 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:58,369 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:58,370 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:58,370 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:58,370 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-14 04:56:58,444 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 04:56:58,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:58,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:58,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:56:58,553 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-14 04:56:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:56:58,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 04:56:58,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:58,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:58,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:58,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:56:58,639 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-14 04:56:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:56:58,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 04:56:58,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:58,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:58,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:58,683 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:58,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:56:58,706 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-14 04:56:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 04:56:58,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 04:56:58,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:58,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 04:56:58,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:58,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-14 04:56:58,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:58,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 04:56:58,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:58,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-14 04:56:58,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:56:58,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:56:58,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:56:58,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:58,715 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:58,715 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:58,715 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:58,716 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:56:58,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:56:58,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:58,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:56:58,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:56:58 BoogieIcfgContainer [2019-01-14 04:56:58,722 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:56:58,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:56:58,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:56:58,723 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:56:58,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46" (3/4) ... [2019-01-14 04:56:58,727 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:56:58,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:56:58,728 INFO L168 Benchmark]: Toolchain (without parser) took 13326.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:58,729 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:58,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:58,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:58,731 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:58,731 INFO L168 Benchmark]: RCFGBuilder took 433.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:58,732 INFO L168 Benchmark]: BuchiAutomizer took 12147.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:58,733 INFO L168 Benchmark]: Witness Printer took 4.17 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-14 04:56:58,738 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.82 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 433.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12147.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 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 12.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.0s. Construction of modules took 0.8s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s 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: 14ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...