./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer --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.23-1dbac8b [2018-10-27 06:08:05,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:05,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:05,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:05,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:05,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:05,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:05,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:05,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:05,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:05,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:05,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:05,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:05,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:05,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:05,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:05,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:05,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:05,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:05,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:05,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:05,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:05,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:05,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:05,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:05,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:05,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:05,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:05,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:05,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:05,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:05,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:05,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:05,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:05,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:05,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:05,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:05,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:05,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:05,326 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:05,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:05,326 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:05,326 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:05,326 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:05,326 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:05,327 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:05,327 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:05,327 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:05,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:05,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:05,328 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:05,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:05,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:05,330 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:05,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:05,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:05,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:05,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:05,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:05,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:05,331 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:05,332 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:05,332 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer 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 [2018-10-27 06:08:05,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:05,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:05,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:05,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:05,373 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:05,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:05,425 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/data/c6fa6bc90/df5ecf88bc2f46fab12a3fee8001399e/FLAGaf84467b8 [2018-10-27 06:08:05,808 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:05,809 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:05,819 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/data/c6fa6bc90/df5ecf88bc2f46fab12a3fee8001399e/FLAGaf84467b8 [2018-10-27 06:08:05,831 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/data/c6fa6bc90/df5ecf88bc2f46fab12a3fee8001399e [2018-10-27 06:08:05,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:05,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:05,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:05,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:05,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:05,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:05" (1/1) ... [2018-10-27 06:08:05,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef510a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:05, skipping insertion in model container [2018-10-27 06:08:05,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:05" (1/1) ... [2018-10-27 06:08:05,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:05,903 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:06,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:06,162 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:06,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:06,267 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:06,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06 WrapperNode [2018-10-27 06:08:06,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:06,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:06,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:06,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:06,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:06,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:06,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:06,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:06,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... [2018-10-27 06:08:06,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:06,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:06,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:06,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:06,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0fcff89-3056-47e5-a0b1-58837384e7da/bin-2019/uautomizer/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 [2018-10-27 06:08:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:06,980 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:06,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:06 BoogieIcfgContainer [2018-10-27 06:08:06,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:06,982 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:06,982 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:06,986 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:06,987 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:06,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:05" (1/3) ... [2018-10-27 06:08:06,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@281f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:06, skipping insertion in model container [2018-10-27 06:08:06,989 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:06,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:06" (2/3) ... [2018-10-27 06:08:06,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@281f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:06, skipping insertion in model container [2018-10-27 06:08:06,989 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:06,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:06" (3/3) ... [2018-10-27 06:08:06,991 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:07,043 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:07,044 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:07,044 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:07,044 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:07,044 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:07,044 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:07,044 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:07,044 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:07,044 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:07,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:08:07,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:08:07,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:07,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:07,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:07,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:07,086 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:07,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:08:07,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:08:07,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:07,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:07,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:07,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:07,096 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 14#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L558-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 8#L545-4true [2018-10-27 06:08:07,096 INFO L795 eck$LassoCheckResult]: Loop: 8#L545-4true assume true; 20#L545-1true assume !!(test_fun_~i~0 < test_fun_~N); 22#L546-4true assume !true; 3#L550-3true assume !true; 7#L545-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 8#L545-4true [2018-10-27 06:08:07,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-10-27 06:08:07,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 41206463, now seen corresponding path program 1 times [2018-10-27 06:08:07,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:07,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:07,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:07,261 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:08:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:08:07,280 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-27 06:08:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:07,290 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-10-27 06:08:07,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:08:07,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-10-27 06:08:07,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:08:07,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2018-10-27 06:08:07,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:07,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:07,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-10-27 06:08:07,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:07,300 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:08:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-10-27 06:08:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 06:08:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:08:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-10-27 06:08:07,326 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:08:07,326 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:08:07,326 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:07,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-10-27 06:08:07,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:08:07,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:07,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:07,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:07,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:07,329 INFO L793 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 60#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 61#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 66#L545-4 [2018-10-27 06:08:07,329 INFO L795 eck$LassoCheckResult]: Loop: 66#L545-4 assume true; 70#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 71#L546-4 assume true; 67#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 68#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 59#L550-3 assume true; 62#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 77#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 73#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 66#L545-4 [2018-10-27 06:08:07,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-10-27 06:08:07,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2145679071, now seen corresponding path program 1 times [2018-10-27 06:08:07,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash 632420219, now seen corresponding path program 1 times [2018-10-27 06:08:07,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,533 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:08:07,744 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 06:08:07,928 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-27 06:08:07,936 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:07,937 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:07,937 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:07,937 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:07,937 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:07,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:07,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:07,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:07,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-10-27 06:08:07,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:07,938 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:07,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,633 WARN L179 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-27 06:08:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,089 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:09,092 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:09,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,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 [2018-10-27 06:08:09,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,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 [2018-10-27 06:08:09,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,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 [2018-10-27 06:08:09,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:09,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:09,326 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:09,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:09,329 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:09,330 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:09,330 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-10-27 06:08:09,363 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:09,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:09,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:09,452 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 [2018-10-27 06:08:09,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-10-27 06:08:09,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-10-27 06:08:09,518 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 [2018-10-27 06:08:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-10-27 06:08:09,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 9 letters. [2018-10-27 06:08:09,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 13 letters. Loop has 9 letters. [2018-10-27 06:08:09,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 18 letters. [2018-10-27 06:08:09,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-10-27 06:08:09,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:09,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 47 transitions. [2018-10-27 06:08:09,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:09,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:08:09,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-10-27 06:08:09,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:09,525 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-27 06:08:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-10-27 06:08:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-27 06:08:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 06:08:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-27 06:08:09,528 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 06:08:09,528 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 06:08:09,528 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:09,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2018-10-27 06:08:09,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:09,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:09,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:09,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,531 INFO L793 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 199#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 200#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 209#L545-4 assume true; 216#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 217#L546-4 [2018-10-27 06:08:09,531 INFO L795 eck$LassoCheckResult]: Loop: 217#L546-4 assume true; 210#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 211#L546-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 203#L547 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547 204#L547-1 test_fun_#t~post5 := test_fun_#t~mem4; 207#L547-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547-2 214#L547-3 havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 217#L546-4 [2018-10-27 06:08:09,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-10-27 06:08:09,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-10-27 06:08:09,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-10-27 06:08:09,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:09,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,766 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-27 06:08:09,805 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:09,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:09,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:09,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:09,805 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:09,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:09,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:09,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:09,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-10-27 06:08:09,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:09,805 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:09,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:09,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,039 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-27 06:08:10,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,343 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:10,344 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:10,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,387 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:10,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:10,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,430 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:10,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:10,431 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:10,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:10,432 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:10,432 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:10,432 INFO L519 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 [] [2018-10-27 06:08:10,481 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:10,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:10,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-27 06:08:10,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 33 [2018-10-27 06:08:10,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:08:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:10,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:10,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:08:10,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 94 states and 105 transitions. Complement of second has 13 states. [2018-10-27 06:08:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-10-27 06:08:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 7 letters. [2018-10-27 06:08:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:08:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 14 letters. [2018-10-27 06:08:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 105 transitions. [2018-10-27 06:08:10,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:10,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 75 states and 86 transitions. [2018-10-27 06:08:10,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:08:10,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:08:10,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 86 transitions. [2018-10-27 06:08:10,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:10,937 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-10-27 06:08:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 86 transitions. [2018-10-27 06:08:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2018-10-27 06:08:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:08:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-10-27 06:08:10,943 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-10-27 06:08:10,944 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-10-27 06:08:10,944 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:10,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions. [2018-10-27 06:08:10,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:10,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:10,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:10,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:10,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:10,945 INFO L793 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 419#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 420#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 429#L545-4 assume true; 436#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 437#L546-4 assume true; 430#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 431#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 416#L550-3 [2018-10-27 06:08:10,945 INFO L795 eck$LassoCheckResult]: Loop: 416#L550-3 assume true; 421#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 456#L550-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 452#L551 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 453#L551-1 test_fun_#t~post9 := test_fun_#t~mem8; 458#L551-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-2 415#L551-3 havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 416#L550-3 [2018-10-27 06:08:10,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924623, now seen corresponding path program 1 times [2018-10-27 06:08:10,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 1 times [2018-10-27 06:08:10,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:10,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1589097121, now seen corresponding path program 1 times [2018-10-27 06:08:10,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,284 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:08:11,527 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-10-27 06:08:11,568 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:11,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:11,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:11,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:11,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:11,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:11,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:11,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:11,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-10-27 06:08:11,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:11,568 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:11,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,992 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:11,992 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:11,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:12,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,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 [2018-10-27 06:08:12,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:12,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:12,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:12,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:12,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,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 [2018-10-27 06:08:12,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:12,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:12,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:12,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:12,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:12,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:12,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:12,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:12,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:12,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:12,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:12,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,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 [2018-10-27 06:08:12,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,022 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:12,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,024 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:12,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:12,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:12,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:12,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:12,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:12,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:12,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:12,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:12,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:12,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:12,046 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:12,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:12,047 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:12,048 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:12,048 INFO L519 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 [] [2018-10-27 06:08:12,096 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:12,100 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:12,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:12,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:12,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:12,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:12,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:08:12,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:08:12,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:08:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:12,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:12,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-10-27 06:08:12,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 92 states and 105 transitions. Complement of second has 13 states. [2018-10-27 06:08:12,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:08:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 7 letters. [2018-10-27 06:08:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-10-27 06:08:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 14 letters. [2018-10-27 06:08:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:12,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 105 transitions. [2018-10-27 06:08:12,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:12,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 61 states and 70 transitions. [2018-10-27 06:08:12,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:08:12,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:12,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 70 transitions. [2018-10-27 06:08:12,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:12,285 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-10-27 06:08:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 70 transitions. [2018-10-27 06:08:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-27 06:08:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:08:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-10-27 06:08:12,288 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:08:12,288 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:08:12,288 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:12,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-10-27 06:08:12,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:12,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:12,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:12,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,290 INFO L793 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 671#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 672#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 681#L545-4 assume true; 692#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 693#L546-4 assume true; 719#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 717#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 713#L550-3 assume true; 711#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 708#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 695#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 696#L545-4 assume true; 691#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 688#L546-4 [2018-10-27 06:08:12,290 INFO L795 eck$LassoCheckResult]: Loop: 688#L546-4 assume true; 684#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 685#L546-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 675#L547 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547 676#L547-1 test_fun_#t~post5 := test_fun_#t~mem4; 679#L547-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547-2 682#L547-3 havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 688#L546-4 [2018-10-27 06:08:12,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2129525152, now seen corresponding path program 2 times [2018-10-27 06:08:12,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-10-27 06:08:12,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2022717757, now seen corresponding path program 1 times [2018-10-27 06:08:12,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,624 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:08:12,816 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-27 06:08:13,251 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-10-27 06:08:13,304 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:13,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:13,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:13,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:13,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:13,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:13,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:13,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:13,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:08:13,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:13,305 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:13,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,019 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:14,020 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:14,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 [2018-10-27 06:08:14,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,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 [2018-10-27 06:08:14,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,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 [2018-10-27 06:08:14,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,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 [2018-10-27 06:08:14,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,055 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:14,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,057 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:14,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,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 [2018-10-27 06:08:14,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:14,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:14,076 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:14,076 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:14,076 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:14,076 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:14,076 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-10-27 06:08:14,227 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:08:14,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:14,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-27 06:08:14,327 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:14,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:08:14,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:08:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:14,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:14,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:08:14,416 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 86 states and 97 transitions. Complement of second has 13 states. [2018-10-27 06:08:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-10-27 06:08:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:08:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:14,419 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:14,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-27 06:08:14,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:14,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:08:14,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:08:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:14,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:14,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:08:14,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 85 states and 96 transitions. Complement of second has 15 states. [2018-10-27 06:08:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-10-27 06:08:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:08:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:14,647 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:14,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-27 06:08:14,722 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:14,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:08:14,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:08:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:14,753 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 6 loop predicates [2018-10-27 06:08:14,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:08:14,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 125 states and 140 transitions. Complement of second has 12 states. [2018-10-27 06:08:14,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-10-27 06:08:14,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:08:14,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:14,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 22 letters. Loop has 7 letters. [2018-10-27 06:08:14,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:14,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 14 letters. [2018-10-27 06:08:14,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:14,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 140 transitions. [2018-10-27 06:08:14,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:14,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 89 states and 101 transitions. [2018-10-27 06:08:14,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:08:14,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:08:14,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 101 transitions. [2018-10-27 06:08:14,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:14,836 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-10-27 06:08:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 101 transitions. [2018-10-27 06:08:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-10-27 06:08:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 06:08:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-10-27 06:08:14,843 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 06:08:14,843 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 06:08:14,843 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:14,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-10-27 06:08:14,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:14,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:14,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:14,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:14,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:14,844 INFO L793 eck$LassoCheckResult]: Stem: 1352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1326#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1327#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 1334#L545-4 assume true; 1344#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 1345#L546-4 assume true; 1338#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 1339#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1380#L550-3 assume true; 1330#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 1361#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1350#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 1351#L545-4 assume true; 1342#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 1343#L546-4 assume true; 1336#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 1337#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1323#L550-3 [2018-10-27 06:08:14,848 INFO L795 eck$LassoCheckResult]: Loop: 1323#L550-3 assume true; 1328#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 1360#L550-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1354#L551 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 1355#L551-1 test_fun_#t~post9 := test_fun_#t~mem8; 1358#L551-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-2 1322#L551-3 havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 1323#L550-3 [2018-10-27 06:08:14,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 278147897, now seen corresponding path program 3 times [2018-10-27 06:08:14,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:14,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 2 times [2018-10-27 06:08:14,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:14,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 900166645, now seen corresponding path program 1 times [2018-10-27 06:08:14,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:15,080 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-10-27 06:08:15,128 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:15,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:15,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:15,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:15,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:15,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:15,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:15,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:15,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-10-27 06:08:15,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:15,129 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:15,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,383 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-27 06:08:15,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:15,636 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:15,637 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:15,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,690 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:15,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:15,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:15,726 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:15,726 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:15,727 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:15,727 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:15,728 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:15,728 INFO L519 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 [] [2018-10-27 06:08:15,785 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-10-27 06:08:15,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:15,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:08:15,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:15,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:08:15,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:08:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:15,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:15,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:08:15,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 79 states and 92 transitions. Complement of second has 13 states. [2018-10-27 06:08:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:08:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:08:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:15,991 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:16,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,140 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:08:16,144 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:16,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:08:16,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:08:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:16,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:16,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:08:16,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 78 states and 91 transitions. Complement of second has 15 states. [2018-10-27 06:08:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-10-27 06:08:16,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:08:16,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,257 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:16,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:08:16,411 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:16,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:08:16,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:08:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:16,457 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 6 loop predicates [2018-10-27 06:08:16,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:08:16,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 93 states and 109 transitions. Complement of second has 12 states. [2018-10-27 06:08:16,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-10-27 06:08:16,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:08:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 25 letters. Loop has 7 letters. [2018-10-27 06:08:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 14 letters. [2018-10-27 06:08:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 109 transitions. [2018-10-27 06:08:16,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:16,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:16,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:16,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:16,501 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:16,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:16,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:16,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:16,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:16 BoogieIcfgContainer [2018-10-27 06:08:16,508 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:16,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:16,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:16,508 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:16,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:06" (3/4) ... [2018-10-27 06:08:16,511 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:16,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:16,512 INFO L168 Benchmark]: Toolchain (without parser) took 10677.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 951.8 MB in the beginning and 1.3 GB in the end (delta: -300.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,513 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:16,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,514 INFO L168 Benchmark]: Boogie Preprocessor took 33.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,514 INFO L168 Benchmark]: RCFGBuilder took 579.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,515 INFO L168 Benchmark]: BuchiAutomizer took 9526.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -122.2 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,520 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:16,522 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 430.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 579.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9526.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -122.2 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 #length - 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 -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 191 SDtfs, 201 SDslu, 130 SDs, 0 SdLazy, 284 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf99 lsp90 ukn88 mio100 lsp49 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...