./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/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 64bit --witnessprinter.graph.data.programhash 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11:41,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:41,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:41,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:41,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:41,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:41,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:41,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:41,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:41,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:41,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:41,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:41,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:41,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:41,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:41,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:41,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:41,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:41,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:41,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:41,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:41,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:41,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:41,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:41,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:41,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:41,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:41,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:41,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:41,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:41,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:41,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:41,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:41,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:41,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:41,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:41,456 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:41,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:41,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:41,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:41,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:41,471 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:41,471 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:41,471 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:41,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:41,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:41,473 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:41,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:41,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:41,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:41,476 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:41,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:41,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:41,476 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:41,477 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:41,477 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_d0b95768-dfae-40cf-a8e9-deff0bc66913/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2018-10-27 06:11:41,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:41,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:41,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:41,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:41,520 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:41,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-10-27 06:11:41,567 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/data/f3dcf54d6/f44317cfdf4246cd8ddefe7a613ce56c/FLAG9c7a5f0a8 [2018-10-27 06:11:41,944 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:41,945 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-10-27 06:11:41,953 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/data/f3dcf54d6/f44317cfdf4246cd8ddefe7a613ce56c/FLAG9c7a5f0a8 [2018-10-27 06:11:41,966 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/data/f3dcf54d6/f44317cfdf4246cd8ddefe7a613ce56c [2018-10-27 06:11:41,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:41,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:41,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:41,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:41,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:41,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:41" (1/1) ... [2018-10-27 06:11:41,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:41, skipping insertion in model container [2018-10-27 06:11:41,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:41" (1/1) ... [2018-10-27 06:11:41,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:42,019 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:42,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:42,294 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:42,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:42,379 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:42,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42 WrapperNode [2018-10-27 06:11:42,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:42,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:42,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:42,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:42,389 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:11:42" (1/1) ... [2018-10-27 06:11:42,401 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:11:42" (1/1) ... [2018-10-27 06:11:42,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:42,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:42,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:42,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:42,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... [2018-10-27 06:11:42,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:42,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:42,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:42,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:42,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/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:11:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:43,174 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:43,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:43 BoogieIcfgContainer [2018-10-27 06:11:43,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:43,175 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:43,175 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:43,178 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:43,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:43,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:41" (1/3) ... [2018-10-27 06:11:43,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2024fb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:43, skipping insertion in model container [2018-10-27 06:11:43,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:43,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:42" (2/3) ... [2018-10-27 06:11:43,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2024fb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:43, skipping insertion in model container [2018-10-27 06:11:43,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:43,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:43" (3/3) ... [2018-10-27 06:11:43,183 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2018-10-27 06:11:43,257 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:43,258 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:43,258 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:43,258 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:43,258 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:43,258 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:43,259 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:43,259 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:43,259 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:43,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:11:43,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:11:43,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:43,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:43,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:43,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:43,319 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:43,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:11:43,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:11:43,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:43,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:43,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:43,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:43,329 INFO L793 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 8#L369true assume !(main_~length~0 < 1); 12#L369-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 6#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 23#L372-3true [2018-10-27 06:11:43,330 INFO L795 eck$LassoCheckResult]: Loop: 23#L372-3true assume true; 20#L372-1true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 4#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 18#L374-2true SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 13#L377true main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 23#L372-3true [2018-10-27 06:11:43,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-10-27 06:11:43,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:43,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash 45963670, now seen corresponding path program 1 times [2018-10-27 06:11:43,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:43,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:43,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1986381362, now seen corresponding path program 1 times [2018-10-27 06:11:43,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:43,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:43,659 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:11:44,034 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-27 06:11:44,214 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:11:44,240 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:44,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:44,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:44,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:44,241 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:44,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:44,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:44,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:44,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:11:44,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:44,242 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:44,263 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:11:44,274 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:11:44,276 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:11:44,306 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:11:44,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:11:44,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:11:44,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:11:44,320 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:11:44,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:11:44,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:11:44,686 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-27 06:11:44,757 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:11:44,760 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:11:45,135 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:45,140 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:45,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:45,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:45,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:45,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:45,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:45,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:45,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:45,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:45,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:45,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:45,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:45,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:45,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:45,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:45,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:45,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:45,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:45,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:45,307 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:45,309 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:45,311 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:45,312 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:45,312 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:11:45,342 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:11:45,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:45,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:45,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:45,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:45,472 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:11:45,488 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:11:45,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-10-27 06:11:45,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 63 states and 78 transitions. Complement of second has 7 states. [2018-10-27 06:11:45,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-10-27 06:11:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 5 letters. [2018-10-27 06:11:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 5 letters. [2018-10-27 06:11:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 10 letters. [2018-10-27 06:11:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:45,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. [2018-10-27 06:11:45,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:45,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 28 transitions. [2018-10-27 06:11:45,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:11:45,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:11:45,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-10-27 06:11:45,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:45,576 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:11:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-10-27 06:11:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:11:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:11:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-10-27 06:11:45,605 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:11:45,605 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:11:45,605 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:45,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-10-27 06:11:45,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:45,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:45,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:45,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:45,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:45,607 INFO L793 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 167#L369 assume !(main_~length~0 < 1); 177#L369-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 172#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 173#L372-3 assume true; 168#L372-1 assume !(main_~i~0 < main_~length~0); 169#L372-4 main_~j~0 := 0; 160#L379-4 [2018-10-27 06:11:45,608 INFO L795 eck$LassoCheckResult]: Loop: 160#L379-4 assume true; 163#L379-1 assume !!(main_~j~0 < main_~length~0); 161#L380-4 assume true; 162#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 178#L380-2 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 159#L379-3 main_#t~post210 := main_~j~0;main_~j~0 := main_#t~post210 + 1;havoc main_#t~post210; 160#L379-4 [2018-10-27 06:11:45,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash 176703704, now seen corresponding path program 1 times [2018-10-27 06:11:45,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:45,687 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:11:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:11:45,690 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:45,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 1 times [2018-10-27 06:11:45,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:11:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:11:45,752 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:11:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:45,804 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:11:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:45,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:11:45,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:45,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 32 transitions. [2018-10-27 06:11:45,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:11:45,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:11:45,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-10-27 06:11:45,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:45,808 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 06:11:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-10-27 06:11:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-10-27 06:11:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:11:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:11:45,810 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:45,810 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:45,810 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:45,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:11:45,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:45,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:45,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:45,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:45,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:45,812 INFO L793 eck$LassoCheckResult]: Stem: 229#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 225#L369 assume !(main_~length~0 < 1); 235#L369-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 230#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 231#L372-3 assume true; 228#L372-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 222#L374 assume !(main_~val~0 > main_~limit~0); 223#L374-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 215#L377 main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 216#L372-3 assume true; 226#L372-1 assume !(main_~i~0 < main_~length~0); 227#L372-4 main_~j~0 := 0; 220#L379-4 [2018-10-27 06:11:45,812 INFO L795 eck$LassoCheckResult]: Loop: 220#L379-4 assume true; 221#L379-1 assume !!(main_~j~0 < main_~length~0); 217#L380-4 assume true; 218#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 236#L380-2 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 219#L379-3 main_#t~post210 := main_~j~0;main_~j~0 := main_#t~post210 + 1;havoc main_#t~post210; 220#L379-4 [2018-10-27 06:11:45,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash -170474767, now seen corresponding path program 1 times [2018-10-27 06:11:45,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:45,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:45,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 2 times [2018-10-27 06:11:45,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:45,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:45,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:45,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1238241570, now seen corresponding path program 1 times [2018-10-27 06:11:45,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:45,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:46,270 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-10-27 06:11:46,320 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:46,321 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:46,321 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:46,321 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:46,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:46,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:46,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:46,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:46,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:11:46,322 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:46,322 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:46,324 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:11:46,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:11:46,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:11:46,332 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:11:46,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:11:46,335 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:11:46,338 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:11:46,339 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:11:46,480 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:11:46,481 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:11:46,483 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:11:46,484 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:11:46,749 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:46,749 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:46,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:46,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:46,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:46,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:46,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:46,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:46,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:46,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:46,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:46,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:46,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:46,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:46,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:46,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:46,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:46,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:46,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:46,829 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:46,829 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:11:46,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:46,838 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:46,839 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:46,839 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2018-10-27 06:11:46,924 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:11:46,925 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:46,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:46,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:46,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:47,056 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:11:47,056 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:11:47,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:11:47,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 6 states. [2018-10-27 06:11:47,104 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:11:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:11:47,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 6 letters. [2018-10-27 06:11:47,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:47,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 19 letters. Loop has 6 letters. [2018-10-27 06:11:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 12 letters. [2018-10-27 06:11:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:47,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-10-27 06:11:47,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:47,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-10-27 06:11:47,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:11:47,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:11:47,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-10-27 06:11:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:47,108 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 06:11:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-10-27 06:11:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-10-27 06:11:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:11:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-10-27 06:11:47,111 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-27 06:11:47,111 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-27 06:11:47,111 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:47,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-10-27 06:11:47,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:47,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:47,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:47,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:47,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:47,113 INFO L793 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 381#L369 assume !(main_~length~0 < 1); 394#L369-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 383#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 384#L372-3 assume true; 387#L372-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 378#L374 assume !(main_~val~0 > main_~limit~0); 379#L374-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 367#L377 main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 368#L372-3 assume true; 385#L372-1 assume !(main_~i~0 < main_~length~0); 386#L372-4 main_~j~0 := 0; 375#L379-4 assume true; 377#L379-1 assume !!(main_~j~0 < main_~length~0); 369#L380-4 [2018-10-27 06:11:47,113 INFO L795 eck$LassoCheckResult]: Loop: 369#L380-4 assume true; 370#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 395#L380-2 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 388#L381 SUMMARY for call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381 389#L381-1 main_#t~post213 := main_#t~mem212; 392#L381-2 SUMMARY for call write~int(main_#t~post213 + 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381-2 397#L381-3 havoc main_#t~mem212;havoc main_#t~post213; 369#L380-4 [2018-10-27 06:11:47,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash -617492554, now seen corresponding path program 1 times [2018-10-27 06:11:47,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:47,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 1 times [2018-10-27 06:11:47,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:47,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:47,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1017797342, now seen corresponding path program 1 times [2018-10-27 06:11:47,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:47,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:47,377 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:47,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:47,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:47,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:47,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:47,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:47,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:47,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:47,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:11:47,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:47,378 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:47,380 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:11:47,390 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:11:47,392 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:11:47,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:11:47,399 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:11:47,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:11:47,402 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:11:47,408 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:11:47,409 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:11:47,415 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:11:47,416 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:11:47,596 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-27 06:11:47,651 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:11:47,951 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:47,952 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:47,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:47,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:47,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:47,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:47,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:47,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:47,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:47,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:47,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:47,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:47,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:11:47,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:47,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:47,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:47,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:47,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:48,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:48,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:48,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:48,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:48,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:48,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:48,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:48,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:48,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:48,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:48,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:48,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:48,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:48,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:48,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:48,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:48,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:48,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:48,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:48,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:48,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:48,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:48,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:48,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:48,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:48,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:48,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:48,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:48,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:48,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:48,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:48,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:48,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:48,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:48,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:48,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:48,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:48,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:48,058 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:48,068 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:48,068 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:11:48,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:48,071 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:48,071 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:48,071 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2018-10-27 06:11:48,122 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:11:48,127 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:11:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:48,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:48,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:48,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:48,483 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:11:48,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:48,517 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:11:48,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:48,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:48,544 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:11:48,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:24 [2018-10-27 06:11:48,582 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:11:48,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:11:48,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-10-27 06:11:48,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9. Second operand 9 states. Result 65 states and 74 transitions. Complement of second has 14 states. [2018-10-27 06:11:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:11:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-10-27 06:11:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:11:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:48,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 22 letters. Loop has 7 letters. [2018-10-27 06:11:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:48,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 15 letters. Loop has 14 letters. [2018-10-27 06:11:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:48,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2018-10-27 06:11:48,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:48,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 45 states and 52 transitions. [2018-10-27 06:11:48,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:11:48,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:11:48,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2018-10-27 06:11:48,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:48,716 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-10-27 06:11:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2018-10-27 06:11:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-27 06:11:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 06:11:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-27 06:11:48,719 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:11:48,719 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:11:48,719 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:11:48,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-10-27 06:11:48,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:48,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:48,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:48,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:48,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:48,721 INFO L793 eck$LassoCheckResult]: Stem: 610#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 606#L369 assume !(main_~length~0 < 1); 619#L369-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 611#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 612#L372-3 assume true; 609#L372-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 603#L374 assume !(main_~val~0 > main_~limit~0); 604#L374-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 591#L377 main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 592#L372-3 assume true; 607#L372-1 assume !(main_~i~0 < main_~length~0); 608#L372-4 main_~j~0 := 0; 599#L379-4 assume true; 600#L379-1 assume !!(main_~j~0 < main_~length~0); 625#L380-4 assume true; 630#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 628#L380-2 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 593#L379-3 main_#t~post210 := main_~j~0;main_~j~0 := main_#t~post210 + 1;havoc main_#t~post210; 594#L379-4 assume true; 602#L379-1 assume !!(main_~j~0 < main_~length~0); 595#L380-4 [2018-10-27 06:11:48,721 INFO L795 eck$LassoCheckResult]: Loop: 595#L380-4 assume true; 596#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 620#L380-2 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 613#L381 SUMMARY for call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381 614#L381-1 main_#t~post213 := main_#t~mem212; 617#L381-2 SUMMARY for call write~int(main_#t~post213 + 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381-2 622#L381-3 havoc main_#t~mem212;havoc main_#t~post213; 595#L380-4 [2018-10-27 06:11:48,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 244209063, now seen corresponding path program 2 times [2018-10-27 06:11:48,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:48,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:48,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:48,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0b95768-dfae-40cf-a8e9-deff0bc66913/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:48,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:48,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:48,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:49,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:49,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-10-27 06:11:49,029 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:49,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 2 times [2018-10-27 06:11:49,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:49,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:49,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:11:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:11:49,098 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 14 states. [2018-10-27 06:11:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:49,363 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-10-27 06:11:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:11:49,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-10-27 06:11:49,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:49,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 53 states and 61 transitions. [2018-10-27 06:11:49,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:11:49,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:11:49,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 61 transitions. [2018-10-27 06:11:49,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:49,366 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-10-27 06:11:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 61 transitions. [2018-10-27 06:11:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-27 06:11:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 06:11:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-10-27 06:11:49,369 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-10-27 06:11:49,369 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-10-27 06:11:49,369 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:11:49,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2018-10-27 06:11:49,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:49,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:49,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:49,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:49,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:49,371 INFO L793 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 829#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 830#L369 assume !(main_~length~0 < 1); 843#L369-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 832#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 833#L372-3 assume true; 844#L372-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 857#L374 assume !(main_~val~0 > main_~limit~0); 856#L374-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 814#L377 main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 815#L372-3 assume true; 836#L372-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 826#L374 assume !(main_~val~0 > main_~limit~0); 827#L374-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L374-2 828#L377 main_#t~post208 := main_~i~0;main_~i~0 := main_#t~post208 + 1;havoc main_#t~post208; 855#L372-3 assume true; 834#L372-1 assume !(main_~i~0 < main_~length~0); 835#L372-4 main_~j~0 := 0; 822#L379-4 assume true; 823#L379-1 assume !!(main_~j~0 < main_~length~0); 858#L380-4 assume true; 819#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 846#L380-2 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 820#L379-3 main_#t~post210 := main_~j~0;main_~j~0 := main_#t~post210 + 1;havoc main_#t~post210; 821#L379-4 assume true; 825#L379-1 assume !!(main_~j~0 < main_~length~0); 816#L380-4 [2018-10-27 06:11:49,371 INFO L795 eck$LassoCheckResult]: Loop: 816#L380-4 assume true; 817#L380-1 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L380-1 845#L380-2 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 837#L381 SUMMARY for call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381 838#L381-1 main_#t~post213 := main_#t~mem212; 841#L381-2 SUMMARY for call write~int(main_#t~post213 + 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L381-2 847#L381-3 havoc main_#t~mem212;havoc main_#t~post213; 816#L380-4 [2018-10-27 06:11:49,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash 851364910, now seen corresponding path program 3 times [2018-10-27 06:11:49,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:49,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 3 times [2018-10-27 06:11:49,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1879191978, now seen corresponding path program 1 times [2018-10-27 06:11:49,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:49,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:49,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:49,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:49,688 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2018-10-27 06:11:49,769 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:49,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:49,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:49,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:49,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:49,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:49,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:49,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:49,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:11:49,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:49,770 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:49,772 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:11:49,861 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:11:49,863 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:11:49,865 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:11:49,875 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:11:49,876 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:11:49,878 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:11:49,880 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:11:49,883 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:11:49,886 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:11:49,894 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:11:49,896 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:11:49,897 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:11:50,060 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:50,060 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:50,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:50,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:50,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:50,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:50,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:50,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:50,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:50,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:50,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:11:50,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:50,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:50,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:50,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:50,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:50,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:50,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:50,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:50,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:50,068 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:50,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:50,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:50,069 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:50,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:50,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:50,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:11:50,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:50,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:50,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:50,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:50,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:50,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:50,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:50,083 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:50,083 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:50,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:50,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:50,084 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:50,084 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1 Supporting invariants [] [2018-10-27 06:11:50,134 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:11:50,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:11:50,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,384 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:50,386 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:11:50,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:50,391 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:11:50,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,405 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:11:50,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2018-10-27 06:11:50,416 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:11:50,416 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:11:50,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:11:50,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 60 states and 69 transitions. Complement of second has 13 states. [2018-10-27 06:11:50,460 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:11:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:11:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:11:50,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:11:50,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:50,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:50,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:50,580 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:11:50,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:50,590 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:11:50,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,600 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:11:50,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2018-10-27 06:11:50,610 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:11:50,610 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:11:50,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:11:50,671 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 59 states and 68 transitions. Complement of second has 15 states. [2018-10-27 06:11:50,671 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:11:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:11:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-10-27 06:11:50,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:11:50,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:50,672 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:50,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:50,795 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:11:50,797 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:50,798 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:11:50,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:50,807 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:11:50,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2018-10-27 06:11:50,817 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:11:50,817 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:11:50,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:11:51,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 74 states and 86 transitions. Complement of second has 12 states. [2018-10-27 06:11:51,026 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:11:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:11:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-10-27 06:11:51,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:11:51,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:51,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 33 letters. Loop has 7 letters. [2018-10-27 06:11:51,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:51,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 14 letters. [2018-10-27 06:11:51,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:51,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2018-10-27 06:11:51,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:51,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-10-27 06:11:51,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:51,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:51,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:51,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:51,034 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:51,034 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:51,034 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:51,034 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:11:51,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:51,034 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:51,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:51,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:51 BoogieIcfgContainer [2018-10-27 06:11:51,043 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:51,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:51,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:51,044 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:51,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:43" (3/4) ... [2018-10-27 06:11:51,050 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:51,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:51,052 INFO L168 Benchmark]: Toolchain (without parser) took 9082.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 954.2 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,052 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:51,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.34 ms. Allocated memory is still 1.0 GB. Free memory was 954.2 MB in the beginning and 926.2 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 926.2 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,054 INFO L168 Benchmark]: Boogie Preprocessor took 45.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,054 INFO L168 Benchmark]: RCFGBuilder took 632.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,055 INFO L168 Benchmark]: BuchiAutomizer took 7868.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.1 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:51,055 INFO L168 Benchmark]: Witness Printer took 6.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:51,062 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.34 ms. Allocated memory is still 1.0 GB. Free memory was 954.2 MB in the beginning and 926.2 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 926.2 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 632.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7868.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.1 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][arr] and consists of 8 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 158 SDtfs, 340 SDslu, 203 SDs, 0 SdLazy, 280 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax100 hnf98 lsp94 ukn93 mio100 lsp48 div100 bol100 ite100 ukn100 eq167 hnf88 smp93 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...