./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c --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_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/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 0baccb6c9a05802d446420fb16b8e65dc76eab5e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:18:35,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:18:35,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:18:35,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:18:35,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:18:35,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:18:35,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:18:35,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:18:35,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:18:35,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:18:35,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:18:35,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:18:35,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:18:35,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:18:35,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:18:35,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:18:35,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:18:35,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:18:35,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:18:35,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:18:35,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:18:35,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:18:35,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:18:35,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:18:35,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:18:35,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:18:35,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:18:35,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:18:35,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:18:35,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:18:35,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:18:35,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:18:35,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:18:35,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:18:35,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:18:35,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:18:35,821 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:18:35,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:18:35,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:18:35,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:18:35,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:18:35,831 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:18:35,831 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:18:35,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:18:35,832 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:18:35,833 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:18:35,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:18:35,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:18:35,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:18:35,835 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:18:35,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:18:35,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:18:35,836 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:18:35,837 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:18:35,837 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_d53f231b-1b36-434f-8809-1fe138282015/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 -> 0baccb6c9a05802d446420fb16b8e65dc76eab5e [2018-11-10 07:18:35,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:18:35,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:18:35,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:18:35,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:18:35,874 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:18:35,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c [2018-11-10 07:18:35,922 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/data/40da5c382/95493cde22314a7bbf053d0cd4731cae/FLAGf37b9a742 [2018-11-10 07:18:36,245 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:18:36,245 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/sv-benchmarks/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c [2018-11-10 07:18:36,249 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/data/40da5c382/95493cde22314a7bbf053d0cd4731cae/FLAGf37b9a742 [2018-11-10 07:18:36,260 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/data/40da5c382/95493cde22314a7bbf053d0cd4731cae [2018-11-10 07:18:36,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:18:36,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:18:36,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:18:36,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:18:36,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:18:36,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36, skipping insertion in model container [2018-11-10 07:18:36,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:18:36,287 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:18:36,382 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:18:36,385 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:18:36,394 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:18:36,402 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:18:36,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36 WrapperNode [2018-11-10 07:18:36,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:18:36,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:18:36,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:18:36,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:18:36,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:18:36,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:18:36,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:18:36,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:18:36,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... [2018-11-10 07:18:36,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:18:36,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:18:36,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:18:36,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:18:36,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/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-11-10 07:18:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:18:36,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:18:36,639 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:18:36,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:18:36 BoogieIcfgContainer [2018-11-10 07:18:36,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:18:36,640 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:18:36,640 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:18:36,644 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:18:36,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:18:36,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:18:36" (1/3) ... [2018-11-10 07:18:36,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ccee63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:18:36, skipping insertion in model container [2018-11-10 07:18:36,646 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:18:36,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:18:36" (2/3) ... [2018-11-10 07:18:36,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ccee63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:18:36, skipping insertion in model container [2018-11-10 07:18:36,646 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:18:36,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:18:36" (3/3) ... [2018-11-10 07:18:36,648 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_Nested_true-termination_true-no-overflow.c [2018-11-10 07:18:36,687 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:18:36,687 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:18:36,687 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:18:36,687 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:18:36,687 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:18:36,687 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:18:36,688 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:18:36,688 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:18:36,688 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:18:36,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 07:18:36,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:18:36,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:36,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:36,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:36,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:18:36,721 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:18:36,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 07:18:36,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:18:36,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:36,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:36,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:36,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:18:36,728 INFO L793 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 7#L10-3true [2018-11-10 07:18:36,728 INFO L795 eck$LassoCheckResult]: Loop: 7#L10-3true assume true; 12#L10-1true assume !!(main_~i~0 < 10);main_~j~0 := 3; 13#L12-3true assume !true; 9#L12-4true main_~i~0 := main_~i~0 + 1; 7#L10-3true [2018-11-10 07:18:36,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:18:36,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1114569, now seen corresponding path program 1 times [2018-11-10 07:18:36,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:18:36,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:18:36,825 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:18:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:18:36,836 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2018-11-10 07:18:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:36,840 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-10 07:18:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:18:36,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-10 07:18:36,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:18:36,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-11-10 07:18:36,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 07:18:36,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 07:18:36,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-10 07:18:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:36,847 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:18:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-10 07:18:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-10 07:18:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:18:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-10 07:18:36,871 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:18:36,871 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:18:36,871 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:18:36,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-10 07:18:36,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:18:36,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:36,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:36,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:36,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:18:36,872 INFO L793 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 31#L10-3 [2018-11-10 07:18:36,873 INFO L795 eck$LassoCheckResult]: Loop: 31#L10-3 assume true; 36#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 35#L12-3 assume true; 33#L12-1 assume !(main_~j~0 < 12); 34#L12-4 main_~i~0 := main_~i~0 + 1; 31#L10-3 [2018-11-10 07:18:36,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 07:18:36,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 34543791, now seen corresponding path program 1 times [2018-11-10 07:18:36,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:36,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:18:36,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:18:36,917 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:18:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:18:36,918 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 07:18:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:36,925 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-10 07:18:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:18:36,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-10 07:18:36,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:18:36,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-10 07:18:36,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 07:18:36,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 07:18:36,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-10 07:18:36,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:36,927 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 07:18:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-10 07:18:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-10 07:18:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 07:18:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-10 07:18:36,928 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 07:18:36,928 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 07:18:36,928 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:18:36,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-10 07:18:36,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:18:36,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:36,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:36,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:36,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 07:18:36,929 INFO L793 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 53#L10-3 [2018-11-10 07:18:36,929 INFO L795 eck$LassoCheckResult]: Loop: 53#L10-3 assume true; 57#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 59#L12-3 assume true; 55#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 56#L12-3 assume true; 60#L12-1 assume !(main_~j~0 < 12); 58#L12-4 main_~i~0 := main_~i~0 + 1; 53#L10-3 [2018-11-10 07:18:36,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,930 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 07:18:36,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:36,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:36,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1163104599, now seen corresponding path program 1 times [2018-11-10 07:18:36,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:36,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:36,961 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/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-11-10 07:18:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:36,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 07:18:37,011 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:18:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:18:37,011 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 07:18:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,028 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-10 07:18:37,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:18:37,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-10 07:18:37,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 07:18:37,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-11-10 07:18:37,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 07:18:37,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 07:18:37,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-10 07:18:37,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,030 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 07:18:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-10 07:18:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 07:18:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 07:18:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-10 07:18:37,031 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 07:18:37,031 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 07:18:37,031 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:18:37,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-10 07:18:37,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 07:18:37,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-11-10 07:18:37,032 INFO L793 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 98#L10-3 [2018-11-10 07:18:37,032 INFO L795 eck$LassoCheckResult]: Loop: 98#L10-3 assume true; 102#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 104#L12-3 assume true; 100#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 101#L12-3 assume true; 105#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 107#L12-3 assume true; 106#L12-1 assume !(main_~j~0 < 12); 103#L12-4 main_~i~0 := main_~i~0 + 1; 98#L10-3 [2018-11-10 07:18:37,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,032 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 07:18:37,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1051972061, now seen corresponding path program 2 times [2018-11-10 07:18:37,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,065 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:18:37,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:18:37,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 07:18:37,104 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:18:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:18:37,105 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 07:18:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,120 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-10 07:18:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:18:37,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-10 07:18:37,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:18:37,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 07:18:37,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 07:18:37,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 07:18:37,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-10 07:18:37,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,124 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:18:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-10 07:18:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 07:18:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 07:18:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 07:18:37,126 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:18:37,127 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:18:37,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:18:37,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-10 07:18:37,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:18:37,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2018-11-10 07:18:37,128 INFO L793 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 154#L10-3 [2018-11-10 07:18:37,128 INFO L795 eck$LassoCheckResult]: Loop: 154#L10-3 assume true; 158#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 160#L12-3 assume true; 156#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 157#L12-3 assume true; 161#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 165#L12-3 assume true; 164#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 163#L12-3 assume true; 162#L12-1 assume !(main_~j~0 < 12); 159#L12-4 main_~i~0 := main_~i~0 + 1; 154#L10-3 [2018-11-10 07:18:37,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 07:18:37,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1627785443, now seen corresponding path program 3 times [2018-11-10 07:18:37,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,194 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:18:37,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 07:18:37,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:18:37,232 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:18:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:18:37,232 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-10 07:18:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,250 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-10 07:18:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:18:37,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-10 07:18:37,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:18:37,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-10 07:18:37,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 07:18:37,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 07:18:37,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-10 07:18:37,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,252 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 07:18:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-10 07:18:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 07:18:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 07:18:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-10 07:18:37,254 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 07:18:37,254 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 07:18:37,254 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:18:37,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-10 07:18:37,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:18:37,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2018-11-10 07:18:37,255 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 221#L10-3 [2018-11-10 07:18:37,255 INFO L795 eck$LassoCheckResult]: Loop: 221#L10-3 assume true; 225#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 227#L12-3 assume true; 223#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 224#L12-3 assume true; 228#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 234#L12-3 assume true; 233#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 232#L12-3 assume true; 231#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 230#L12-3 assume true; 229#L12-1 assume !(main_~j~0 < 12); 226#L12-4 main_~i~0 := main_~i~0 + 1; 221#L10-3 [2018-11-10 07:18:37,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 07:18:37,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,260 INFO L82 PathProgramCache]: Analyzing trace with hash -933664361, now seen corresponding path program 4 times [2018-11-10 07:18:37,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,319 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:18:37,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:18:37,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 07:18:37,368 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:18:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:18:37,369 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-10 07:18:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,386 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-10 07:18:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:18:37,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-10 07:18:37,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:18:37,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 07:18:37,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 07:18:37,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 07:18:37,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-10 07:18:37,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,388 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 07:18:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-10 07:18:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 07:18:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 07:18:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 07:18:37,390 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 07:18:37,390 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 07:18:37,390 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:18:37,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 07:18:37,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:18:37,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2018-11-10 07:18:37,391 INFO L793 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 299#L10-3 [2018-11-10 07:18:37,392 INFO L795 eck$LassoCheckResult]: Loop: 299#L10-3 assume true; 303#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 306#L12-3 assume true; 301#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 302#L12-3 assume true; 305#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 314#L12-3 assume true; 313#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 312#L12-3 assume true; 311#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 310#L12-3 assume true; 309#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 308#L12-3 assume true; 307#L12-1 assume !(main_~j~0 < 12); 304#L12-4 main_~i~0 := main_~i~0 + 1; 299#L10-3 [2018-11-10 07:18:37,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 07:18:37,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 396764561, now seen corresponding path program 5 times [2018-11-10 07:18:37,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,448 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 07:18:37,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 07:18:37,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 07:18:37,485 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:18:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:18:37,486 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-10 07:18:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,502 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-10 07:18:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:18:37,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-11-10 07:18:37,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 07:18:37,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 07:18:37,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 07:18:37,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 07:18:37,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-10 07:18:37,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,504 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 07:18:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-10 07:18:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 07:18:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 07:18:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 07:18:37,505 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 07:18:37,505 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 07:18:37,505 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:18:37,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-10 07:18:37,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 07:18:37,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2018-11-10 07:18:37,506 INFO L793 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 388#L10-3 [2018-11-10 07:18:37,506 INFO L795 eck$LassoCheckResult]: Loop: 388#L10-3 assume true; 392#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 395#L12-3 assume true; 390#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 391#L12-3 assume true; 394#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 405#L12-3 assume true; 404#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 403#L12-3 assume true; 402#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 401#L12-3 assume true; 400#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 399#L12-3 assume true; 398#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 397#L12-3 assume true; 396#L12-1 assume !(main_~j~0 < 12); 393#L12-4 main_~i~0 := main_~i~0 + 1; 388#L10-3 [2018-11-10 07:18:37,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 07:18:37,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash -961295605, now seen corresponding path program 6 times [2018-11-10 07:18:37,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,573 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,579 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 07:18:37,587 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 07:18:37,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 07:18:37,615 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:18:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:18:37,615 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 9 states. [2018-11-10 07:18:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,627 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-10 07:18:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:18:37,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-10 07:18:37,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 07:18:37,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 07:18:37,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 07:18:37,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 07:18:37,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-10 07:18:37,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,628 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 07:18:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-10 07:18:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 07:18:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 07:18:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 07:18:37,629 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 07:18:37,629 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 07:18:37,630 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:18:37,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-10 07:18:37,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 07:18:37,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2018-11-10 07:18:37,630 INFO L793 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 488#L10-3 [2018-11-10 07:18:37,630 INFO L795 eck$LassoCheckResult]: Loop: 488#L10-3 assume true; 492#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 495#L12-3 assume true; 490#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 491#L12-3 assume true; 494#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 507#L12-3 assume true; 506#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 505#L12-3 assume true; 504#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 503#L12-3 assume true; 502#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 501#L12-3 assume true; 500#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 499#L12-3 assume true; 498#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 497#L12-3 assume true; 496#L12-1 assume !(main_~j~0 < 12); 493#L12-4 main_~i~0 := main_~i~0 + 1; 488#L10-3 [2018-11-10 07:18:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 07:18:37,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash -387057147, now seen corresponding path program 7 times [2018-11-10 07:18:37,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,716 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 07:18:37,767 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:18:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:18:37,768 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-10 07:18:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:37,815 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-10 07:18:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:18:37,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-10 07:18:37,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 07:18:37,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 07:18:37,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:18:37,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 07:18:37,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-10 07:18:37,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:37,819 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 07:18:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-10 07:18:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 07:18:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:18:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 07:18:37,821 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 07:18:37,821 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 07:18:37,821 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:18:37,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-10 07:18:37,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 07:18:37,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:37,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:37,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:37,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2018-11-10 07:18:37,823 INFO L793 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 599#L10-3 [2018-11-10 07:18:37,823 INFO L795 eck$LassoCheckResult]: Loop: 599#L10-3 assume true; 603#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 605#L12-3 assume true; 601#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 602#L12-3 assume true; 606#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 620#L12-3 assume true; 619#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 618#L12-3 assume true; 617#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 616#L12-3 assume true; 615#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 614#L12-3 assume true; 613#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 612#L12-3 assume true; 611#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 610#L12-3 assume true; 609#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 608#L12-3 assume true; 607#L12-1 assume !(main_~j~0 < 12); 604#L12-4 main_~i~0 := main_~i~0 + 1; 599#L10-3 [2018-11-10 07:18:37,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 07:18:37,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:37,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:37,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1700287103, now seen corresponding path program 8 times [2018-11-10 07:18:37,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:37,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:18:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:18:37,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:18:37,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:18:37,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:37,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:18:37,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 07:18:37,977 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:18:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:18:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:18:37,978 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 11 states. [2018-11-10 07:18:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:38,002 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 07:18:38,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:18:38,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 07:18:38,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 07:18:38,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 07:18:38,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 07:18:38,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 07:18:38,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 07:18:38,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:38,004 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 07:18:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 07:18:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 07:18:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 07:18:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 07:18:38,006 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 07:18:38,006 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 07:18:38,006 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:18:38,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-10 07:18:38,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 07:18:38,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:38,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:38,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:18:38,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2018-11-10 07:18:38,008 INFO L793 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 721#L10-3 [2018-11-10 07:18:38,008 INFO L795 eck$LassoCheckResult]: Loop: 721#L10-3 assume true; 725#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 728#L12-3 assume true; 723#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 724#L12-3 assume true; 727#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 744#L12-3 assume true; 743#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 742#L12-3 assume true; 741#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 740#L12-3 assume true; 739#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 738#L12-3 assume true; 737#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 736#L12-3 assume true; 735#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 734#L12-3 assume true; 733#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 732#L12-3 assume true; 731#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 730#L12-3 assume true; 729#L12-1 assume !(main_~j~0 < 12); 726#L12-4 main_~i~0 := main_~i~0 + 1; 721#L10-3 [2018-11-10 07:18:38,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 07:18:38,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1888384121, now seen corresponding path program 9 times [2018-11-10 07:18:38,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1852397175, now seen corresponding path program 1 times [2018-11-10 07:18:38,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,154 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-10 07:18:38,171 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:38,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:38,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:38,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:38,173 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:18:38,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:38,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:38,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-10 07:18:38,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:38,174 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:38,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,263 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:38,263 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,266 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:18:38,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,322 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:38,322 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=-3}, {ULTIMATE.start_main_~c~0=-2}, {ULTIMATE.start_main_~c~0=14}] Lambdas: [1, 8, 1] Nus: [0, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,359 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:38,359 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,381 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:38,381 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,388 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:38,388 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=12} Honda state: {ULTIMATE.start_main_~j~0=12} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,415 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:18:38,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,452 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:18:38,454 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:38,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:38,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:38,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:38,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:18:38,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:38,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:38,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-10 07:18:38,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:38,455 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:38,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,519 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:38,523 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:18:38,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:18:38,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:38,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:38,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:38,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:38,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:18:38,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:18:38,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:38,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:18:38,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:18:38,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:38,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:38,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:38,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:38,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:38,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:38,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:38,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:38,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:38,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:38,552 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:18:38,554 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:18:38,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:18:38,556 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:18:38,556 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:18:38,556 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:18:38,557 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-10 07:18:38,558 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:18:38,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:38,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:38,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 07:18:38,627 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-11-10 07:18:38,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 07:18:38,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 48 states and 51 transitions. Complement of second has 6 states. [2018-11-10 07:18:38,656 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-11-10 07:18:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:18:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-10 07:18:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2018-11-10 07:18:38,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2018-11-10 07:18:38,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2018-11-10 07:18:38,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2018-11-10 07:18:38,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:18:38,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2018-11-10 07:18:38,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:18:38,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 07:18:38,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2018-11-10 07:18:38,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:18:38,663 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-10 07:18:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2018-11-10 07:18:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-11-10 07:18:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 07:18:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-10 07:18:38,665 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 07:18:38,665 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 07:18:38,665 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:18:38,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-11-10 07:18:38,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:18:38,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:38,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:38,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:18:38,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 07:18:38,670 INFO L793 eck$LassoCheckResult]: Stem: 893#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 892#L10-3 assume true; 899#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 895#L12-3 [2018-11-10 07:18:38,670 INFO L795 eck$LassoCheckResult]: Loop: 895#L12-3 assume true; 894#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 895#L12-3 [2018-11-10 07:18:38,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash 925641, now seen corresponding path program 1 times [2018-11-10 07:18:38,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 1 times [2018-11-10 07:18:38,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:38,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 889541519, now seen corresponding path program 1 times [2018-11-10 07:18:38,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,735 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:38,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:38,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:38,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:38,736 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:18:38,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:38,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:38,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 07:18:38,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:38,736 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,778 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:38,778 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,801 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:38,801 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:38,805 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:18:38,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:38,858 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:18:38,859 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:38,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:38,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:38,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:38,860 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:18:38,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:38,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:38,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 07:18:38,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:38,860 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:38,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-11-10 07:18:38,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-11-10 07:18:38,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:38,894 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:38,895 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:18:38,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:38,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:38,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:38,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:38,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:38,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:38,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:38,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:38,898 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:18:38,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:18:38,899 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:18:38,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:18:38,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:18:38,900 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:18:38,900 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] [2018-11-10 07:18:38,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:18:38,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:38,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:38,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:38,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:18:38,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 07:18:38,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 73 states and 79 transitions. Complement of second has 5 states. [2018-11-10 07:18:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:18:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:18:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:18:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-10 07:18:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-10 07:18:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-10 07:18:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:38,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2018-11-10 07:18:38,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:18:38,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2018-11-10 07:18:38,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 07:18:38,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 07:18:38,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-11-10 07:18:38,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:18:38,932 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-10 07:18:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-11-10 07:18:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-10 07:18:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 07:18:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-10 07:18:38,934 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 07:18:38,935 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 07:18:38,935 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:18:38,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2018-11-10 07:18:38,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:18:38,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:18:38,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:18:38,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2018-11-10 07:18:38,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 07:18:38,936 INFO L793 eck$LassoCheckResult]: Stem: 1033#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 1032#L10-3 assume true; 1038#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 1080#L12-3 assume true; 1079#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1078#L12-3 assume true; 1076#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1074#L12-3 assume true; 1072#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1070#L12-3 assume true; 1068#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1066#L12-3 assume true; 1064#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1062#L12-3 assume true; 1060#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1058#L12-3 assume true; 1056#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1054#L12-3 assume true; 1052#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1050#L12-3 assume true; 1049#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1048#L12-3 assume true; 1044#L12-1 assume !(main_~j~0 < 12); 1042#L12-4 main_~i~0 := main_~i~0 + 1; 1039#L10-3 assume true; 1041#L10-1 assume !!(main_~i~0 < 10);main_~j~0 := 3; 1035#L12-3 [2018-11-10 07:18:38,937 INFO L795 eck$LassoCheckResult]: Loop: 1035#L12-3 assume true; 1034#L12-1 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := main_~c~0 + 1;main_~j~0 := main_~j~0 + 2; 1035#L12-3 [2018-11-10 07:18:38,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2037224829, now seen corresponding path program 2 times [2018-11-10 07:18:38,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:38,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 2 times [2018-11-10 07:18:38,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -732025789, now seen corresponding path program 3 times [2018-11-10 07:18:38,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:18:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:18:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:18:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:18:38,997 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:38,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:38,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:38,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:38,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:18:38,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:38,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:38,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:38,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 07:18:38,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:38,998 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:38,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,048 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:39,048 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:39,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:39,094 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:39,094 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:39,104 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:18:39,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:39,177 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:18:39,178 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=-3}, {ULTIMATE.start_main_~c~0=4}] Lambdas: [12, 1, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:18:39,198 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d53f231b-1b36-434f-8809-1fe138282015/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:18:39,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:18:39,247 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:18:39,249 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:18:39,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:18:39,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:18:39,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:18:39,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:18:39,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:18:39,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:18:39,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:18:39,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 07:18:39,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:18:39,250 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:18:39,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:18:39,294 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:18:39,295 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:18:39,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:39,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:39,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:39,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:39,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:39,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:18:39,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:18:39,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:39,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:39,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:39,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:39,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:39,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:39,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:39,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:39,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:39,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:18:39,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:18:39,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:18:39,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:18:39,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:18:39,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:18:39,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:18:39,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:18:39,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:18:39,315 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:18:39,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:18:39,317 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:18:39,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:18:39,318 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:18:39,318 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:18:39,318 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] [2018-11-10 07:18:39,318 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:18:39,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:39,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:18:39,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 07:18:39,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 68 states and 73 transitions. Complement of second has 5 states. [2018-11-10 07:18:39,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:18:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:18:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:18:39,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 07:18:39,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:39,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:18:39,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:39,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:18:39,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 07:18:39,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 68 states and 73 transitions. Complement of second has 5 states. [2018-11-10 07:18:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:18:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:18:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:18:39,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 07:18:39,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:39,395 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:18:39,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:39,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:18:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:18:39,417 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 1 loop predicates [2018-11-10 07:18:39,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 07:18:39,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 76 states and 82 transitions. Complement of second has 4 states. [2018-11-10 07:18:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:18:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:18:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-10 07:18:39,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 07:18:39,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:39,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2018-11-10 07:18:39,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:39,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2018-11-10 07:18:39,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:18:39,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2018-11-10 07:18:39,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:18:39,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2018-11-10 07:18:39,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:18:39,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:18:39,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:18:39,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:18:39,428 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:18:39,428 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:18:39,429 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:18:39,429 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:18:39,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:18:39,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:18:39,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:18:39,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:18:39 BoogieIcfgContainer [2018-11-10 07:18:39,434 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:18:39,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:18:39,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:18:39,435 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:18:39,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:18:36" (3/4) ... [2018-11-10 07:18:39,438 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:18:39,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:18:39,438 INFO L168 Benchmark]: Toolchain (without parser) took 3176.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.3 MB in the beginning and 996.7 MB in the end (delta: -36.4 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:18:39,439 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:18:39,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:18:39,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.51 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:18:39,440 INFO L168 Benchmark]: Boogie Preprocessor took 15.90 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:18:39,440 INFO L168 Benchmark]: RCFGBuilder took 195.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:18:39,441 INFO L168 Benchmark]: BuchiAutomizer took 2794.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 131.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:18:39,441 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:18:39,443 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.51 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.90 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 195.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2794.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 131.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 14 iterations. TraceHistogramMax:10. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 117 SDtfs, 38 SDslu, 179 SDs, 0 SdLazy, 155 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax171 hnf99 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...