./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_13_false-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_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_13_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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 c0d0ad10124da460587cca853afd7fd9944c9aa2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:55,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:55,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:55,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:55,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:55,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:55,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:55,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:55,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:55,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:55,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:55,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:55,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:55,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:55,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:55,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:55,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:55,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:55,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:55,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:55,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:55,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:55,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:55,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:55,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:55,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:55,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:55,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:55,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:55,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:55,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:55,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:55,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:55,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:55,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:55,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:55,494 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:55,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:55,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:55,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:55,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:55,515 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:55,515 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:55,516 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:55,516 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:55,516 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:55,516 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:55,517 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:55,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:55,517 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:55,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:55,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:55,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:55,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:55,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:55,519 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:55,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:55,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:55,519 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:55,520 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:55,520 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_5a8ab925-4f09-441e-ba13-0bf83efecd43/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 -> c0d0ad10124da460587cca853afd7fd9944c9aa2 [2018-10-27 06:10:55,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:55,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:55,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:55,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:55,578 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:55,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_13_false-termination_true-no-overflow.c [2018-10-27 06:10:55,629 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/data/779f8138e/05e24d550ae14bcbb152646281473479/FLAGff65416dd [2018-10-27 06:10:56,015 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:56,017 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/sv-benchmarks/c/termination-restricted-15/NO_13_false-termination_true-no-overflow.c [2018-10-27 06:10:56,022 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/data/779f8138e/05e24d550ae14bcbb152646281473479/FLAGff65416dd [2018-10-27 06:10:56,038 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/data/779f8138e/05e24d550ae14bcbb152646281473479 [2018-10-27 06:10:56,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:56,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:56,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:56,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:56,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:56,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43804fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56, skipping insertion in model container [2018-10-27 06:10:56,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:56,079 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:56,222 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:56,226 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:56,238 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:56,250 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:56,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56 WrapperNode [2018-10-27 06:10:56,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:56,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:56,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:56,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:56,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:56,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:56,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:56,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:56,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:56,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:56,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:56,297 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:56,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:56,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:56,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:56,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:56 BoogieIcfgContainer [2018-10-27 06:10:56,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:56,687 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:56,687 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:56,690 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:56,696 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:56,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:56" (1/3) ... [2018-10-27 06:10:56,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48628b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:56, skipping insertion in model container [2018-10-27 06:10:56,697 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:56,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56" (2/3) ... [2018-10-27 06:10:56,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48628b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:56, skipping insertion in model container [2018-10-27 06:10:56,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:56,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:56" (3/3) ... [2018-10-27 06:10:56,700 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_13_false-termination_true-no-overflow.c [2018-10-27 06:10:56,756 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:56,756 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:56,756 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:56,756 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:56,756 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:56,757 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:56,757 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:56,757 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:56,757 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:56,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-10-27 06:10:56,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:56,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:56,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:56,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:56,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:10:56,801 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:56,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-10-27 06:10:56,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:56,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:56,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:56,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:56,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:10:56,809 INFO L793 eck$LassoCheckResult]: Stem: 6#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;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4#L12-2true [2018-10-27 06:10:56,810 INFO L795 eck$LassoCheckResult]: Loop: 4#L12-2true assume true; 5#L11-1true assume !!(main_~i~0 < main_~j~0); 8#L12true assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4#L12-2true [2018-10-27 06:10:56,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:10:56,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,903 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-10-27 06:10:56,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-10-27 06:10:56,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:57,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:57,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:57,175 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:57,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:57,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:57,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:57,176 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:57,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:57,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:57,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration1_Loop [2018-10-27 06:10:57,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:57,177 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:57,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,497 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:57,497 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:57,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:57,525 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:57,525 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_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:57,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:57,547 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:57,547 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_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:57,550 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:57,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:57,600 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:57,601 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:57,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:57,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:57,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:57,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:57,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:57,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:57,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:57,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration1_Loop [2018-10-27 06:10:57,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:57,604 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:57,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,780 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:10:57,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:57,858 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:57,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:57,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:57,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:57,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:57,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:57,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:57,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:57,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:57,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:57,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:57,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:57,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:57,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:57,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:57,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:57,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:57,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:57,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:57,897 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:57,897 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:57,899 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:57,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:57,900 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:57,900 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 103 Supporting invariants [] [2018-10-27 06:10:57,901 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:58,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:58,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:58,094 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-10-27 06:10:58,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-10-27 06:10:58,171 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 6 states. [2018-10-27 06:10:58,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-10-27 06:10:58,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-10-27 06:10:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-10-27 06:10:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-10-27 06:10:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:58,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-10-27 06:10:58,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:58,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-10-27 06:10:58,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-10-27 06:10:58,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-10-27 06:10:58,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-10-27 06:10:58,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:58,185 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-10-27 06:10:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-10-27 06:10:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-27 06:10:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-27 06:10:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-10-27 06:10:58,203 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-10-27 06:10:58,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:58,206 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. [2018-10-27 06:10:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:58,216 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-10-27 06:10:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:58,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2018-10-27 06:10:58,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:58,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 9 transitions. [2018-10-27 06:10:58,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-10-27 06:10:58,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-10-27 06:10:58,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-10-27 06:10:58,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:58,218 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-27 06:10:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-10-27 06:10:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-27 06:10:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-27 06:10:58,219 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-27 06:10:58,219 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-27 06:10:58,219 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:58,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2018-10-27 06:10:58,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:58,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:58,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:58,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:10:58,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:10:58,221 INFO L793 eck$LassoCheckResult]: Stem: 101#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;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 98#L12-2 assume true; 99#L11-1 assume !!(main_~i~0 < main_~j~0); 100#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 102#L12-2 [2018-10-27 06:10:58,221 INFO L795 eck$LassoCheckResult]: Loop: 102#L12-2 assume true; 104#L11-1 assume !!(main_~i~0 < main_~j~0); 103#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 102#L12-2 [2018-10-27 06:10:58,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-10-27 06:10:58,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-10-27 06:10:58,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-10-27 06:10:58,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:58,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:58,297 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:58,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:58,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:58,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:58,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-27 06:10:58,402 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:58,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:58,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:58,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:58,403 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:58,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:58,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:58,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:58,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration2_Loop [2018-10-27 06:10:58,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:58,403 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:58,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:58,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:58,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:58,585 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:58,585 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:58,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:58,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:58,610 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:58,610 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_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:10:58,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:58,619 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:58,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:58,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:58,667 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:58,669 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:58,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:58,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:58,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:58,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:58,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:58,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:58,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:58,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration2_Loop [2018-10-27 06:10:58,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:58,670 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:58,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:58,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:58,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,064 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:10:59,112 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:59,112 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:59,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:59,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:59,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:59,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:59,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:59,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:59,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:59,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:59,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:59,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:59,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:59,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:59,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:59,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:59,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:59,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:59,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:59,137 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:59,137 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:59,138 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:59,138 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:59,138 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:59,138 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 103 Supporting invariants [] [2018-10-27 06:10:59,139 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:59,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,176 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-10-27 06:10:59,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-10-27 06:10:59,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-10-27 06:10:59,200 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-10-27 06:10:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-10-27 06:10:59,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2018-10-27 06:10:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 3 letters. [2018-10-27 06:10:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 6 letters. [2018-10-27 06:10:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-10-27 06:10:59,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:59,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2018-10-27 06:10:59,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-10-27 06:10:59,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-10-27 06:10:59,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-10-27 06:10:59,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:59,204 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-10-27 06:10:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-10-27 06:10:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-27 06:10:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-27 06:10:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-10-27 06:10:59,206 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-10-27 06:10:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:59,208 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 4 states. [2018-10-27 06:10:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:59,229 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-10-27 06:10:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:59,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-10-27 06:10:59,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:59,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 12 transitions. [2018-10-27 06:10:59,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-10-27 06:10:59,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-10-27 06:10:59,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-10-27 06:10:59,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:59,232 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-27 06:10:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-10-27 06:10:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-27 06:10:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-27 06:10:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-27 06:10:59,233 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-27 06:10:59,234 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-27 06:10:59,234 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:59,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-10-27 06:10:59,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-10-27 06:10:59,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:59,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:59,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2018-10-27 06:10:59,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:10:59,235 INFO L793 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 214#L12-2 assume true; 215#L11-1 assume !!(main_~i~0 < main_~j~0); 216#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 218#L12-2 assume true; 223#L11-1 assume !!(main_~i~0 < main_~j~0); 222#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 220#L12-2 [2018-10-27 06:10:59,235 INFO L795 eck$LassoCheckResult]: Loop: 220#L12-2 assume true; 221#L11-1 assume !!(main_~i~0 < main_~j~0); 219#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 220#L12-2 [2018-10-27 06:10:59,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 150863075, now seen corresponding path program 2 times [2018-10-27 06:10:59,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-10-27 06:10:59,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:59,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1826081864, now seen corresponding path program 2 times [2018-10-27 06:10:59,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:59,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:59,324 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:59,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:59,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:59,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:59,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-27 06:10:59,397 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:59,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:59,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:59,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:59,397 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:59,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:59,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:59,399 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:59,399 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration3_Loop [2018-10-27 06:10:59,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:59,399 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:59,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,482 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:59,482 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:59,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:59,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:59,502 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:59,502 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_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:59,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:59,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:59,523 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:59,523 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:59,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:59,528 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:59,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:59,548 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:59,570 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:59,571 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:59,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:59,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:59,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:59,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:59,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:59,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:59,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:59,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration3_Loop [2018-10-27 06:10:59,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:59,572 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:59,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,649 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:59,649 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:59,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:59,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:59,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:59,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:59,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:59,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:59,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:59,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:59,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:59,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:59,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:59,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:59,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:59,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:59,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:59,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:59,670 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:59,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:59,673 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:59,674 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:59,674 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:59,674 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:59,674 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 103 Supporting invariants [] [2018-10-27 06:10:59,674 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:59,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,732 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-10-27 06:10:59,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-10-27 06:10:59,740 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 14 transitions. Complement of second has 5 states. [2018-10-27 06:10:59,740 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-10-27 06:10:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-10-27 06:10:59,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 3 letters. [2018-10-27 06:10:59,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,741 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:59,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,768 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-10-27 06:10:59,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-10-27 06:10:59,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 14 transitions. Complement of second has 5 states. [2018-10-27 06:10:59,773 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-10-27 06:10:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-10-27 06:10:59,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 3 letters. [2018-10-27 06:10:59,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,774 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:59,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:59,812 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-10-27 06:10:59,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-10-27 06:10:59,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 16 states and 18 transitions. Complement of second has 4 states. [2018-10-27 06:10:59,822 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-10-27 06:10:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-10-27 06:10:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-10-27 06:10:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-10-27 06:10:59,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-10-27 06:10:59,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:59,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-10-27 06:10:59,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:10:59,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2018-10-27 06:10:59,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-10-27 06:10:59,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-10-27 06:10:59,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-10-27 06:10:59,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:59,826 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-27 06:10:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-10-27 06:10:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-10-27 06:10:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:10:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-27 06:10:59,830 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-27 06:10:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:59,832 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-10-27 06:10:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:59,846 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-10-27 06:10:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:59,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-10-27 06:10:59,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:10:59,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2018-10-27 06:10:59,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:10:59,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:10:59,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-10-27 06:10:59,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:59,848 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-27 06:10:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-10-27 06:10:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-10-27 06:10:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:10:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-10-27 06:10:59,850 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-10-27 06:10:59,850 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-10-27 06:10:59,850 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:59,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-10-27 06:10:59,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:10:59,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:59,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:59,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-10-27 06:10:59,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:10:59,854 INFO L793 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 459#L12-2 assume true; 472#L11-1 assume !!(main_~i~0 < main_~j~0); 468#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 464#L12-2 assume true; 460#L11-1 assume !!(main_~i~0 < main_~j~0); 461#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 471#L12-2 assume true; 466#L11-1 [2018-10-27 06:10:59,854 INFO L795 eck$LassoCheckResult]: Loop: 466#L11-1 assume !!(main_~i~0 < main_~j~0); 470#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 469#L12-2 assume true; 466#L11-1 [2018-10-27 06:10:59,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash 381788035, now seen corresponding path program 3 times [2018-10-27 06:10:59,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,863 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-10-27 06:10:59,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 773962880, now seen corresponding path program 4 times [2018-10-27 06:10:59,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,952 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:59,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:59,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:59,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:59,952 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:59,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:59,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:59,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:59,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration4_Loop [2018-10-27 06:10:59,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:59,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:59,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:59,993 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:59,993 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:10:59,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:59,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:11:00,013 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:11:00,013 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:11:00,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:11:00,016 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:11:00,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:11:00,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:11:00,054 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:11:00,056 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:00,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:00,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:00,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:00,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:00,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:00,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:00,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:00,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration4_Loop [2018-10-27 06:11:00,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:00,057 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:00,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,114 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:00,115 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:00,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:00,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:00,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:00,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:00,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:00,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:00,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:00,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:00,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:00,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:00,126 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:00,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:00,127 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:11:00,127 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:00,127 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-10-27 06:11:00,128 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:11:00,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:00,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-10-27 06:11:00,177 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 5 states. [2018-10-27 06:11:00,178 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-10-27 06:11:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-10-27 06:11:00,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 3 letters. [2018-10-27 06:11:00,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 12 letters. Loop has 3 letters. [2018-10-27 06:11:00,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:11:00,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-10-27 06:11:00,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:11:00,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 23 transitions. [2018-10-27 06:11:00,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-10-27 06:11:00,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-10-27 06:11:00,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-10-27 06:11:00,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:00,182 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:11:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-10-27 06:11:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-10-27 06:11:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:11:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-10-27 06:11:00,183 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:00,183 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:00,183 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:11:00,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-10-27 06:11:00,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:11:00,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:00,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:00,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 1, 1, 1] [2018-10-27 06:11:00,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:11:00,185 INFO L793 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 558#L12-2 assume true; 559#L11-1 assume !!(main_~i~0 < main_~j~0); 562#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 560#L12-2 assume true; 561#L11-1 assume !!(main_~i~0 < main_~j~0); 563#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 574#L12-2 assume true; 572#L11-1 assume !!(main_~i~0 < main_~j~0); 573#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 571#L12-2 assume true; 569#L11-1 assume !!(main_~i~0 < main_~j~0); 570#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 568#L12-2 assume true; 567#L11-1 [2018-10-27 06:11:00,185 INFO L795 eck$LassoCheckResult]: Loop: 567#L11-1 assume !!(main_~i~0 < main_~j~0); 565#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 566#L12-2 assume true; 567#L11-1 [2018-10-27 06:11:00,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1743725217, now seen corresponding path program 3 times [2018-10-27 06:11:00,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:00,263 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:00,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:00,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 06:11:00,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:00,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-27 06:11:00,305 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:00,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 2 times [2018-10-27 06:11:00,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:00,320 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:00,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:00,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:00,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:00,320 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:11:00,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:00,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:00,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:00,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration5_Loop [2018-10-27 06:11:00,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:00,321 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:00,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,365 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:00,366 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:11:00,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:11:00,369 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/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-10-27 06:11:00,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:11:00,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:11:00,411 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:11:00,412 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:00,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:00,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:00,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:00,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:00,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:00,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:00,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:00,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_13_false-termination_true-no-overflow.c_Iteration5_Loop [2018-10-27 06:11:00,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:00,414 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:00,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,510 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:00,510 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:00,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:00,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:00,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:00,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:00,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:00,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:00,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:00,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:00,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:00,518 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:00,522 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:00,523 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:00,523 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:11:00,523 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:00,523 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-10-27 06:11:00,523 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:11:00,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,575 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:00,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:11:00,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 5 states. [2018-10-27 06:11:00,587 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-10-27 06:11:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-10-27 06:11:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2018-10-27 06:11:00,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:00,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:00,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:11:00,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 30 transitions. Complement of second has 7 states. [2018-10-27 06:11:00,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-10-27 06:11:00,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2018-10-27 06:11:00,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:00,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,684 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:00,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:11:00,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 31 states and 36 transitions. Complement of second has 6 states. [2018-10-27 06:11:00,692 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-10-27 06:11:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-10-27 06:11:00,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-10-27 06:11:00,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 3 letters. [2018-10-27 06:11:00,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 6 letters. [2018-10-27 06:11:00,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:00,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-10-27 06:11:00,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:00,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 23 transitions. [2018-10-27 06:11:00,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:00,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:00,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-10-27 06:11:00,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:00,696 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:11:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-10-27 06:11:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-10-27 06:11:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-27 06:11:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-27 06:11:00,697 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-27 06:11:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:00,697 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2018-10-27 06:11:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:00,720 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-10-27 06:11:00,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:11:00,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-10-27 06:11:00,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:00,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2018-10-27 06:11:00,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:00,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:00,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-10-27 06:11:00,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:00,722 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 06:11:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-10-27 06:11:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-10-27 06:11:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:11:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-10-27 06:11:00,724 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-27 06:11:00,724 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-27 06:11:00,724 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:11:00,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-10-27 06:11:00,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:00,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:00,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:00,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 1, 1, 1] [2018-10-27 06:11:00,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:00,725 INFO L793 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 943#L12-2 assume true; 944#L11-1 assume !!(main_~i~0 < main_~j~0); 945#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 948#L12-2 assume true; 946#L11-1 assume !!(main_~i~0 < main_~j~0); 947#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 960#L12-2 assume true; 959#L11-1 assume !!(main_~i~0 < main_~j~0); 958#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 957#L12-2 assume true; 955#L11-1 assume !!(main_~i~0 < main_~j~0); 956#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 954#L12-2 assume true; 952#L11-1 assume !!(main_~i~0 < main_~j~0); 953#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 950#L12-2 assume true; 951#L11-1 [2018-10-27 06:11:00,726 INFO L795 eck$LassoCheckResult]: Loop: 951#L11-1 assume !!(main_~i~0 < main_~j~0); 956#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 954#L12-2 assume true; 952#L11-1 assume !!(main_~i~0 < main_~j~0); 953#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 950#L12-2 assume true; 951#L11-1 [2018-10-27 06:11:00,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -313340450, now seen corresponding path program 4 times [2018-10-27 06:11:00,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:00,804 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:00,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:00,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:00,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:00,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-27 06:11:00,841 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:00,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 1 times [2018-10-27 06:11:00,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:00,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:11:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:11:00,885 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-10-27 06:11:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:00,903 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-10-27 06:11:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:00,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-10-27 06:11:00,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:00,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2018-10-27 06:11:00,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:00,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:00,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-10-27 06:11:00,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:00,905 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-27 06:11:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-10-27 06:11:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-27 06:11:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:11:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-27 06:11:00,906 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-27 06:11:00,906 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-27 06:11:00,906 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:11:00,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-10-27 06:11:00,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:00,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:00,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:00,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 1, 1, 1] [2018-10-27 06:11:00,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:00,907 INFO L793 eck$LassoCheckResult]: Stem: 1056#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1048#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1049#L12-2 assume true; 1050#L11-1 assume !!(main_~i~0 < main_~j~0); 1053#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1069#L12-2 assume true; 1054#L11-1 assume !!(main_~i~0 < main_~j~0); 1055#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1051#L12-2 assume true; 1052#L11-1 assume !!(main_~i~0 < main_~j~0); 1068#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1067#L12-2 assume true; 1066#L11-1 assume !!(main_~i~0 < main_~j~0); 1065#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1064#L12-2 assume true; 1062#L11-1 assume !!(main_~i~0 < main_~j~0); 1063#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1061#L12-2 assume true; 1059#L11-1 assume !!(main_~i~0 < main_~j~0); 1060#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1057#L12-2 assume true; 1058#L11-1 [2018-10-27 06:11:00,907 INFO L795 eck$LassoCheckResult]: Loop: 1058#L11-1 assume !!(main_~i~0 < main_~j~0); 1063#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1061#L12-2 assume true; 1059#L11-1 assume !!(main_~i~0 < main_~j~0); 1060#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1057#L12-2 assume true; 1058#L11-1 [2018-10-27 06:11:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1763246719, now seen corresponding path program 5 times [2018-10-27 06:11:00,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:00,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:00,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:01,010 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-27 06:11:01,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:01,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:01,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-27 06:11:01,031 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:01,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-10-27 06:11:01,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:11:01,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:11:01,076 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-10-27 06:11:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:01,092 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-10-27 06:11:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:11:01,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-10-27 06:11:01,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2018-10-27 06:11:01,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:01,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:01,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-10-27 06:11:01,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:01,094 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-27 06:11:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-10-27 06:11:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-27 06:11:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 06:11:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 06:11:01,098 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 06:11:01,098 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 06:11:01,098 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:11:01,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2018-10-27 06:11:01,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:01,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:01,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 1, 1, 1] [2018-10-27 06:11:01,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:01,100 INFO L793 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1171#L12-2 assume true; 1172#L11-1 assume !!(main_~i~0 < main_~j~0); 1175#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1173#L12-2 assume true; 1174#L11-1 assume !!(main_~i~0 < main_~j~0); 1176#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1194#L12-2 assume true; 1193#L11-1 assume !!(main_~i~0 < main_~j~0); 1192#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1191#L12-2 assume true; 1190#L11-1 assume !!(main_~i~0 < main_~j~0); 1189#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1188#L12-2 assume true; 1187#L11-1 assume !!(main_~i~0 < main_~j~0); 1186#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1185#L12-2 assume true; 1183#L11-1 assume !!(main_~i~0 < main_~j~0); 1184#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1182#L12-2 assume true; 1180#L11-1 assume !!(main_~i~0 < main_~j~0); 1181#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1178#L12-2 assume true; 1179#L11-1 [2018-10-27 06:11:01,100 INFO L795 eck$LassoCheckResult]: Loop: 1179#L11-1 assume !!(main_~i~0 < main_~j~0); 1184#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1182#L12-2 assume true; 1180#L11-1 assume !!(main_~i~0 < main_~j~0); 1181#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1178#L12-2 assume true; 1179#L11-1 [2018-10-27 06:11:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1434810626, now seen corresponding path program 6 times [2018-10-27 06:11:01,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:01,258 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:01,279 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-27 06:11:01,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:01,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:01,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-27 06:11:01,303 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:01,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 3 times [2018-10-27 06:11:01,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:11:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:01,334 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-10-27 06:11:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:01,356 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-10-27 06:11:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:11:01,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-10-27 06:11:01,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2018-10-27 06:11:01,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:01,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:01,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-10-27 06:11:01,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:01,358 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-27 06:11:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-10-27 06:11:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-10-27 06:11:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:11:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-27 06:11:01,360 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:11:01,360 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:11:01,360 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:11:01,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-10-27 06:11:01,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:01,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:01,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 7, 1, 1, 1] [2018-10-27 06:11:01,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:01,361 INFO L793 eck$LassoCheckResult]: Stem: 1316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1309#L12-2 assume true; 1310#L11-1 assume !!(main_~i~0 < main_~j~0); 1313#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1335#L12-2 assume true; 1314#L11-1 assume !!(main_~i~0 < main_~j~0); 1315#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1311#L12-2 assume true; 1312#L11-1 assume !!(main_~i~0 < main_~j~0); 1334#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1333#L12-2 assume true; 1332#L11-1 assume !!(main_~i~0 < main_~j~0); 1331#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1330#L12-2 assume true; 1329#L11-1 assume !!(main_~i~0 < main_~j~0); 1328#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1327#L12-2 assume true; 1326#L11-1 assume !!(main_~i~0 < main_~j~0); 1325#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1324#L12-2 assume true; 1322#L11-1 assume !!(main_~i~0 < main_~j~0); 1323#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1321#L12-2 assume true; 1319#L11-1 assume !!(main_~i~0 < main_~j~0); 1320#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1317#L12-2 assume true; 1318#L11-1 [2018-10-27 06:11:01,361 INFO L795 eck$LassoCheckResult]: Loop: 1318#L11-1 assume !!(main_~i~0 < main_~j~0); 1323#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1321#L12-2 assume true; 1319#L11-1 assume !!(main_~i~0 < main_~j~0); 1320#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1317#L12-2 assume true; 1318#L11-1 [2018-10-27 06:11:01,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash -930664351, now seen corresponding path program 7 times [2018-10-27 06:11:01,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:01,425 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:01,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-27 06:11:01,478 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:01,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 4 times [2018-10-27 06:11:01,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:01,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:11:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:01,530 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-10-27 06:11:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:01,551 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-10-27 06:11:01,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:11:01,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-10-27 06:11:01,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2018-10-27 06:11:01,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:01,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:01,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2018-10-27 06:11:01,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:01,553 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-27 06:11:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2018-10-27 06:11:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-27 06:11:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 06:11:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-27 06:11:01,557 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-27 06:11:01,558 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-27 06:11:01,558 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:11:01,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-10-27 06:11:01,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:01,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:01,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 1, 1, 1] [2018-10-27 06:11:01,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:01,559 INFO L793 eck$LassoCheckResult]: Stem: 1470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1463#L12-2 assume true; 1464#L11-1 assume !!(main_~i~0 < main_~j~0); 1467#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1492#L12-2 assume true; 1468#L11-1 assume !!(main_~i~0 < main_~j~0); 1469#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1465#L12-2 assume true; 1466#L11-1 assume !!(main_~i~0 < main_~j~0); 1491#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1490#L12-2 assume true; 1489#L11-1 assume !!(main_~i~0 < main_~j~0); 1488#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1487#L12-2 assume true; 1486#L11-1 assume !!(main_~i~0 < main_~j~0); 1485#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1484#L12-2 assume true; 1483#L11-1 assume !!(main_~i~0 < main_~j~0); 1482#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1481#L12-2 assume true; 1480#L11-1 assume !!(main_~i~0 < main_~j~0); 1479#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1478#L12-2 assume true; 1476#L11-1 assume !!(main_~i~0 < main_~j~0); 1477#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1475#L12-2 assume true; 1473#L11-1 assume !!(main_~i~0 < main_~j~0); 1474#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1471#L12-2 assume true; 1472#L11-1 [2018-10-27 06:11:01,559 INFO L795 eck$LassoCheckResult]: Loop: 1472#L11-1 assume !!(main_~i~0 < main_~j~0); 1477#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1475#L12-2 assume true; 1473#L11-1 assume !!(main_~i~0 < main_~j~0); 1474#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1471#L12-2 assume true; 1472#L11-1 [2018-10-27 06:11:01,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1409619938, now seen corresponding path program 8 times [2018-10-27 06:11:01,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:01,668 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:01,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:01,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:01,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:01,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:01,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-27 06:11:01,722 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:01,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 5 times [2018-10-27 06:11:01,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:11:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:11:01,785 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-10-27 06:11:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:01,821 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-10-27 06:11:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:11:01,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-10-27 06:11:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2018-10-27 06:11:01,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:01,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:01,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2018-10-27 06:11:01,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:01,823 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-10-27 06:11:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2018-10-27 06:11:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-27 06:11:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 06:11:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-10-27 06:11:01,825 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-10-27 06:11:01,825 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-10-27 06:11:01,825 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:11:01,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 36 transitions. [2018-10-27 06:11:01,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:01,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:01,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:01,832 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 1, 1, 1] [2018-10-27 06:11:01,832 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:01,832 INFO L793 eck$LassoCheckResult]: Stem: 1639#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1633#L12-2 assume true; 1634#L11-1 assume !!(main_~i~0 < main_~j~0); 1635#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1638#L12-2 assume true; 1636#L11-1 assume !!(main_~i~0 < main_~j~0); 1637#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1665#L12-2 assume true; 1664#L11-1 assume !!(main_~i~0 < main_~j~0); 1663#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1662#L12-2 assume true; 1661#L11-1 assume !!(main_~i~0 < main_~j~0); 1660#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1659#L12-2 assume true; 1658#L11-1 assume !!(main_~i~0 < main_~j~0); 1657#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1656#L12-2 assume true; 1655#L11-1 assume !!(main_~i~0 < main_~j~0); 1654#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1653#L12-2 assume true; 1652#L11-1 assume !!(main_~i~0 < main_~j~0); 1651#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1650#L12-2 assume true; 1649#L11-1 assume !!(main_~i~0 < main_~j~0); 1648#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1647#L12-2 assume true; 1645#L11-1 assume !!(main_~i~0 < main_~j~0); 1646#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1644#L12-2 assume true; 1642#L11-1 assume !!(main_~i~0 < main_~j~0); 1643#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1640#L12-2 assume true; 1641#L11-1 [2018-10-27 06:11:01,832 INFO L795 eck$LassoCheckResult]: Loop: 1641#L11-1 assume !!(main_~i~0 < main_~j~0); 1646#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1644#L12-2 assume true; 1642#L11-1 assume !!(main_~i~0 < main_~j~0); 1643#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1640#L12-2 assume true; 1641#L11-1 [2018-10-27 06:11:01,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2094154943, now seen corresponding path program 9 times [2018-10-27 06:11:01,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:01,932 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:01,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-27 06:11:01,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:01,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:01,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-27 06:11:01,974 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:01,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 6 times [2018-10-27 06:11:01,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:01,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:11:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:11:02,012 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-10-27 06:11:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:02,161 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-10-27 06:11:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:11:02,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-10-27 06:11:02,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2018-10-27 06:11:02,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:02,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:02,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-10-27 06:11:02,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:02,164 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-27 06:11:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-10-27 06:11:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-27 06:11:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 06:11:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-10-27 06:11:02,166 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-27 06:11:02,166 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-27 06:11:02,166 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:11:02,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-10-27 06:11:02,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:02,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:02,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 10, 1, 1, 1] [2018-10-27 06:11:02,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:02,172 INFO L793 eck$LassoCheckResult]: Stem: 1825#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1819#L12-2 assume true; 1820#L11-1 assume !!(main_~i~0 < main_~j~0); 1821#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1824#L12-2 assume true; 1822#L11-1 assume !!(main_~i~0 < main_~j~0); 1823#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1854#L12-2 assume true; 1853#L11-1 assume !!(main_~i~0 < main_~j~0); 1852#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1851#L12-2 assume true; 1850#L11-1 assume !!(main_~i~0 < main_~j~0); 1849#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1848#L12-2 assume true; 1847#L11-1 assume !!(main_~i~0 < main_~j~0); 1846#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1845#L12-2 assume true; 1844#L11-1 assume !!(main_~i~0 < main_~j~0); 1843#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1842#L12-2 assume true; 1841#L11-1 assume !!(main_~i~0 < main_~j~0); 1840#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1839#L12-2 assume true; 1838#L11-1 assume !!(main_~i~0 < main_~j~0); 1837#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1836#L12-2 assume true; 1835#L11-1 assume !!(main_~i~0 < main_~j~0); 1834#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1833#L12-2 assume true; 1831#L11-1 assume !!(main_~i~0 < main_~j~0); 1832#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1830#L12-2 assume true; 1828#L11-1 assume !!(main_~i~0 < main_~j~0); 1829#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1826#L12-2 assume true; 1827#L11-1 [2018-10-27 06:11:02,172 INFO L795 eck$LassoCheckResult]: Loop: 1827#L11-1 assume !!(main_~i~0 < main_~j~0); 1832#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 1830#L12-2 assume true; 1828#L11-1 assume !!(main_~i~0 < main_~j~0); 1829#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 1826#L12-2 assume true; 1827#L11-1 [2018-10-27 06:11:02,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1723199806, now seen corresponding path program 10 times [2018-10-27 06:11:02,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:02,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:02,427 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:02,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:02,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:02,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-27 06:11:02,506 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:02,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 7 times [2018-10-27 06:11:02,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,619 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:02,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:11:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:11:02,626 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-10-27 06:11:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:02,674 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-10-27 06:11:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:11:02,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-10-27 06:11:02,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2018-10-27 06:11:02,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:02,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:02,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2018-10-27 06:11:02,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:02,677 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-27 06:11:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2018-10-27 06:11:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-27 06:11:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:11:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-10-27 06:11:02,678 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-10-27 06:11:02,679 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-10-27 06:11:02,679 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:11:02,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 42 transitions. [2018-10-27 06:11:02,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:02,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:02,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 1, 1, 1] [2018-10-27 06:11:02,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:02,683 INFO L793 eck$LassoCheckResult]: Stem: 2027#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2020#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2021#L12-2 assume true; 2022#L11-1 assume !!(main_~i~0 < main_~j~0); 2025#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2023#L12-2 assume true; 2024#L11-1 assume !!(main_~i~0 < main_~j~0); 2026#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2059#L12-2 assume true; 2058#L11-1 assume !!(main_~i~0 < main_~j~0); 2057#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2056#L12-2 assume true; 2055#L11-1 assume !!(main_~i~0 < main_~j~0); 2054#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2053#L12-2 assume true; 2052#L11-1 assume !!(main_~i~0 < main_~j~0); 2051#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2050#L12-2 assume true; 2049#L11-1 assume !!(main_~i~0 < main_~j~0); 2048#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2047#L12-2 assume true; 2046#L11-1 assume !!(main_~i~0 < main_~j~0); 2045#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2044#L12-2 assume true; 2043#L11-1 assume !!(main_~i~0 < main_~j~0); 2042#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2041#L12-2 assume true; 2040#L11-1 assume !!(main_~i~0 < main_~j~0); 2039#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2038#L12-2 assume true; 2037#L11-1 assume !!(main_~i~0 < main_~j~0); 2036#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2035#L12-2 assume true; 2033#L11-1 assume !!(main_~i~0 < main_~j~0); 2034#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2032#L12-2 assume true; 2030#L11-1 assume !!(main_~i~0 < main_~j~0); 2031#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2028#L12-2 assume true; 2029#L11-1 [2018-10-27 06:11:02,683 INFO L795 eck$LassoCheckResult]: Loop: 2029#L11-1 assume !!(main_~i~0 < main_~j~0); 2034#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2032#L12-2 assume true; 2030#L11-1 assume !!(main_~i~0 < main_~j~0); 2031#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2028#L12-2 assume true; 2029#L11-1 [2018-10-27 06:11:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1900503519, now seen corresponding path program 11 times [2018-10-27 06:11:02,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:02,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:02,825 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:02,853 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-27 06:11:02,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:02,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:02,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:02,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-27 06:11:02,887 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:02,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 8 times [2018-10-27 06:11:02,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:02,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:11:02,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:11:02,928 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-10-27 06:11:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:02,966 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-10-27 06:11:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:11:02,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 49 transitions. [2018-10-27 06:11:02,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 47 transitions. [2018-10-27 06:11:02,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:02,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:02,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 47 transitions. [2018-10-27 06:11:02,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:02,968 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-10-27 06:11:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 47 transitions. [2018-10-27 06:11:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-27 06:11:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-27 06:11:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-10-27 06:11:02,972 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-27 06:11:02,972 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-27 06:11:02,972 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:11:02,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2018-10-27 06:11:02,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:02,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:02,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:02,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 12, 1, 1, 1] [2018-10-27 06:11:02,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:02,983 INFO L793 eck$LassoCheckResult]: Stem: 2246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2239#L12-2 assume true; 2240#L11-1 assume !!(main_~i~0 < main_~j~0); 2243#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2280#L12-2 assume true; 2244#L11-1 assume !!(main_~i~0 < main_~j~0); 2245#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2241#L12-2 assume true; 2242#L11-1 assume !!(main_~i~0 < main_~j~0); 2279#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2278#L12-2 assume true; 2277#L11-1 assume !!(main_~i~0 < main_~j~0); 2276#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2275#L12-2 assume true; 2274#L11-1 assume !!(main_~i~0 < main_~j~0); 2273#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2272#L12-2 assume true; 2271#L11-1 assume !!(main_~i~0 < main_~j~0); 2270#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2269#L12-2 assume true; 2268#L11-1 assume !!(main_~i~0 < main_~j~0); 2267#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2266#L12-2 assume true; 2265#L11-1 assume !!(main_~i~0 < main_~j~0); 2264#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2263#L12-2 assume true; 2262#L11-1 assume !!(main_~i~0 < main_~j~0); 2261#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2260#L12-2 assume true; 2259#L11-1 assume !!(main_~i~0 < main_~j~0); 2258#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2257#L12-2 assume true; 2256#L11-1 assume !!(main_~i~0 < main_~j~0); 2255#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2254#L12-2 assume true; 2252#L11-1 assume !!(main_~i~0 < main_~j~0); 2253#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2251#L12-2 assume true; 2249#L11-1 assume !!(main_~i~0 < main_~j~0); 2250#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2247#L12-2 assume true; 2248#L11-1 [2018-10-27 06:11:02,983 INFO L795 eck$LassoCheckResult]: Loop: 2248#L11-1 assume !!(main_~i~0 < main_~j~0); 2253#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2251#L12-2 assume true; 2249#L11-1 assume !!(main_~i~0 < main_~j~0); 2250#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2247#L12-2 assume true; 2248#L11-1 [2018-10-27 06:11:02,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1643273634, now seen corresponding path program 12 times [2018-10-27 06:11:02,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:03,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:03,117 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:03,170 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-10-27 06:11:03,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:03,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:03,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:03,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-27 06:11:03,208 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:03,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 9 times [2018-10-27 06:11:03,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:03,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:03,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:03,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:11:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:11:03,261 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 3 Second operand 15 states. [2018-10-27 06:11:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:03,300 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-27 06:11:03,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 06:11:03,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2018-10-27 06:11:03,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:03,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 50 transitions. [2018-10-27 06:11:03,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:03,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:03,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2018-10-27 06:11:03,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:03,302 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-27 06:11:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2018-10-27 06:11:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-27 06:11:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 06:11:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-10-27 06:11:03,304 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-10-27 06:11:03,304 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-10-27 06:11:03,304 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:11:03,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 48 transitions. [2018-10-27 06:11:03,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:03,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:03,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:03,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 13, 1, 1, 1] [2018-10-27 06:11:03,305 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:03,306 INFO L793 eck$LassoCheckResult]: Stem: 2480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2473#L12-2 assume true; 2474#L11-1 assume !!(main_~i~0 < main_~j~0); 2477#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2517#L12-2 assume true; 2478#L11-1 assume !!(main_~i~0 < main_~j~0); 2479#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2475#L12-2 assume true; 2476#L11-1 assume !!(main_~i~0 < main_~j~0); 2516#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2515#L12-2 assume true; 2514#L11-1 assume !!(main_~i~0 < main_~j~0); 2513#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2512#L12-2 assume true; 2511#L11-1 assume !!(main_~i~0 < main_~j~0); 2510#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2509#L12-2 assume true; 2508#L11-1 assume !!(main_~i~0 < main_~j~0); 2507#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2506#L12-2 assume true; 2505#L11-1 assume !!(main_~i~0 < main_~j~0); 2504#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2503#L12-2 assume true; 2502#L11-1 assume !!(main_~i~0 < main_~j~0); 2501#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2500#L12-2 assume true; 2499#L11-1 assume !!(main_~i~0 < main_~j~0); 2498#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2497#L12-2 assume true; 2496#L11-1 assume !!(main_~i~0 < main_~j~0); 2495#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2494#L12-2 assume true; 2493#L11-1 assume !!(main_~i~0 < main_~j~0); 2492#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2491#L12-2 assume true; 2490#L11-1 assume !!(main_~i~0 < main_~j~0); 2489#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2488#L12-2 assume true; 2486#L11-1 assume !!(main_~i~0 < main_~j~0); 2487#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2485#L12-2 assume true; 2483#L11-1 assume !!(main_~i~0 < main_~j~0); 2484#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2481#L12-2 assume true; 2482#L11-1 [2018-10-27 06:11:03,306 INFO L795 eck$LassoCheckResult]: Loop: 2482#L11-1 assume !!(main_~i~0 < main_~j~0); 2487#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2485#L12-2 assume true; 2483#L11-1 assume !!(main_~i~0 < main_~j~0); 2484#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2481#L12-2 assume true; 2482#L11-1 [2018-10-27 06:11:03,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -729425663, now seen corresponding path program 13 times [2018-10-27 06:11:03,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:03,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:03,748 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:03,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-27 06:11:03,794 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:03,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 10 times [2018-10-27 06:11:03,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 06:11:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:11:03,892 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. cyclomatic complexity: 3 Second operand 16 states. [2018-10-27 06:11:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:03,931 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-10-27 06:11:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:11:03,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2018-10-27 06:11:03,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:03,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 53 transitions. [2018-10-27 06:11:03,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:03,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:03,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2018-10-27 06:11:03,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:03,933 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-10-27 06:11:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2018-10-27 06:11:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-27 06:11:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 06:11:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-10-27 06:11:03,935 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-10-27 06:11:03,935 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-10-27 06:11:03,935 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:11:03,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2018-10-27 06:11:03,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:03,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:03,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:03,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 14, 1, 1, 1] [2018-10-27 06:11:03,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:03,936 INFO L793 eck$LassoCheckResult]: Stem: 2729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2723#L12-2 assume true; 2724#L11-1 assume !!(main_~i~0 < main_~j~0); 2727#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2725#L12-2 assume true; 2726#L11-1 assume !!(main_~i~0 < main_~j~0); 2728#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2770#L12-2 assume true; 2769#L11-1 assume !!(main_~i~0 < main_~j~0); 2768#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2767#L12-2 assume true; 2766#L11-1 assume !!(main_~i~0 < main_~j~0); 2765#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2764#L12-2 assume true; 2763#L11-1 assume !!(main_~i~0 < main_~j~0); 2762#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2761#L12-2 assume true; 2760#L11-1 assume !!(main_~i~0 < main_~j~0); 2759#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2758#L12-2 assume true; 2757#L11-1 assume !!(main_~i~0 < main_~j~0); 2756#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2755#L12-2 assume true; 2754#L11-1 assume !!(main_~i~0 < main_~j~0); 2753#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2752#L12-2 assume true; 2751#L11-1 assume !!(main_~i~0 < main_~j~0); 2750#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2749#L12-2 assume true; 2748#L11-1 assume !!(main_~i~0 < main_~j~0); 2747#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2746#L12-2 assume true; 2745#L11-1 assume !!(main_~i~0 < main_~j~0); 2744#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2743#L12-2 assume true; 2742#L11-1 assume !!(main_~i~0 < main_~j~0); 2741#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2740#L12-2 assume true; 2739#L11-1 assume !!(main_~i~0 < main_~j~0); 2738#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2737#L12-2 assume true; 2735#L11-1 assume !!(main_~i~0 < main_~j~0); 2736#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2734#L12-2 assume true; 2732#L11-1 assume !!(main_~i~0 < main_~j~0); 2733#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2730#L12-2 assume true; 2731#L11-1 [2018-10-27 06:11:03,936 INFO L795 eck$LassoCheckResult]: Loop: 2731#L11-1 assume !!(main_~i~0 < main_~j~0); 2736#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2734#L12-2 assume true; 2732#L11-1 assume !!(main_~i~0 < main_~j~0); 2733#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2730#L12-2 assume true; 2731#L11-1 [2018-10-27 06:11:03,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2082210946, now seen corresponding path program 14 times [2018-10-27 06:11:03,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:04,192 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:04,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:04,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:04,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:04,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-27 06:11:04,278 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:04,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 11 times [2018-10-27 06:11:04,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:04,610 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:11:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:11:04,617 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand 17 states. [2018-10-27 06:11:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:04,647 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-10-27 06:11:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:11:04,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2018-10-27 06:11:04,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:04,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 56 transitions. [2018-10-27 06:11:04,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:04,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:04,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2018-10-27 06:11:04,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:04,649 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-10-27 06:11:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2018-10-27 06:11:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-27 06:11:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:11:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-10-27 06:11:04,652 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-10-27 06:11:04,652 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-10-27 06:11:04,652 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:11:04,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 54 transitions. [2018-10-27 06:11:04,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:04,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:04,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:04,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 15, 1, 1, 1] [2018-10-27 06:11:04,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:04,654 INFO L793 eck$LassoCheckResult]: Stem: 2995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2989#L12-2 assume true; 2990#L11-1 assume !!(main_~i~0 < main_~j~0); 2991#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 2994#L12-2 assume true; 2992#L11-1 assume !!(main_~i~0 < main_~j~0); 2993#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3039#L12-2 assume true; 3038#L11-1 assume !!(main_~i~0 < main_~j~0); 3037#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3036#L12-2 assume true; 3035#L11-1 assume !!(main_~i~0 < main_~j~0); 3034#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3033#L12-2 assume true; 3032#L11-1 assume !!(main_~i~0 < main_~j~0); 3031#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3030#L12-2 assume true; 3029#L11-1 assume !!(main_~i~0 < main_~j~0); 3028#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3027#L12-2 assume true; 3026#L11-1 assume !!(main_~i~0 < main_~j~0); 3025#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3024#L12-2 assume true; 3023#L11-1 assume !!(main_~i~0 < main_~j~0); 3022#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3021#L12-2 assume true; 3020#L11-1 assume !!(main_~i~0 < main_~j~0); 3019#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3018#L12-2 assume true; 3017#L11-1 assume !!(main_~i~0 < main_~j~0); 3016#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3015#L12-2 assume true; 3014#L11-1 assume !!(main_~i~0 < main_~j~0); 3013#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3012#L12-2 assume true; 3011#L11-1 assume !!(main_~i~0 < main_~j~0); 3010#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3009#L12-2 assume true; 3008#L11-1 assume !!(main_~i~0 < main_~j~0); 3007#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3006#L12-2 assume true; 3005#L11-1 assume !!(main_~i~0 < main_~j~0); 3004#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3003#L12-2 assume true; 3001#L11-1 assume !!(main_~i~0 < main_~j~0); 3002#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3000#L12-2 assume true; 2998#L11-1 assume !!(main_~i~0 < main_~j~0); 2999#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2996#L12-2 assume true; 2997#L11-1 [2018-10-27 06:11:04,654 INFO L795 eck$LassoCheckResult]: Loop: 2997#L11-1 assume !!(main_~i~0 < main_~j~0); 3002#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3000#L12-2 assume true; 2998#L11-1 assume !!(main_~i~0 < main_~j~0); 2999#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 2996#L12-2 assume true; 2997#L11-1 [2018-10-27 06:11:04,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1064528865, now seen corresponding path program 15 times [2018-10-27 06:11:04,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 16 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:04,822 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:04,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:04,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-27 06:11:04,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:04,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 16 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:04,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-27 06:11:04,895 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:04,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 12 times [2018-10-27 06:11:04,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:04,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,019 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 06:11:05,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:11:05,032 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. cyclomatic complexity: 3 Second operand 18 states. [2018-10-27 06:11:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:05,097 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-10-27 06:11:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:11:05,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 61 transitions. [2018-10-27 06:11:05,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:05,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 59 transitions. [2018-10-27 06:11:05,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:05,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:05,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 59 transitions. [2018-10-27 06:11:05,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:05,099 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-27 06:11:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 59 transitions. [2018-10-27 06:11:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-27 06:11:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:11:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-27 06:11:05,102 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-27 06:11:05,102 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-27 06:11:05,102 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:11:05,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2018-10-27 06:11:05,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:05,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:05,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:05,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 16, 1, 1, 1] [2018-10-27 06:11:05,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:05,108 INFO L793 eck$LassoCheckResult]: Stem: 3278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3271#L12-2 assume true; 3272#L11-1 assume !!(main_~i~0 < main_~j~0); 3275#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3324#L12-2 assume true; 3276#L11-1 assume !!(main_~i~0 < main_~j~0); 3277#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3273#L12-2 assume true; 3274#L11-1 assume !!(main_~i~0 < main_~j~0); 3323#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3322#L12-2 assume true; 3321#L11-1 assume !!(main_~i~0 < main_~j~0); 3320#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3319#L12-2 assume true; 3318#L11-1 assume !!(main_~i~0 < main_~j~0); 3317#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3316#L12-2 assume true; 3315#L11-1 assume !!(main_~i~0 < main_~j~0); 3314#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3313#L12-2 assume true; 3312#L11-1 assume !!(main_~i~0 < main_~j~0); 3311#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3310#L12-2 assume true; 3309#L11-1 assume !!(main_~i~0 < main_~j~0); 3308#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3307#L12-2 assume true; 3306#L11-1 assume !!(main_~i~0 < main_~j~0); 3305#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3304#L12-2 assume true; 3303#L11-1 assume !!(main_~i~0 < main_~j~0); 3302#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3301#L12-2 assume true; 3300#L11-1 assume !!(main_~i~0 < main_~j~0); 3299#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3298#L12-2 assume true; 3297#L11-1 assume !!(main_~i~0 < main_~j~0); 3296#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3295#L12-2 assume true; 3294#L11-1 assume !!(main_~i~0 < main_~j~0); 3293#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3292#L12-2 assume true; 3291#L11-1 assume !!(main_~i~0 < main_~j~0); 3290#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3289#L12-2 assume true; 3288#L11-1 assume !!(main_~i~0 < main_~j~0); 3287#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3286#L12-2 assume true; 3284#L11-1 assume !!(main_~i~0 < main_~j~0); 3285#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3283#L12-2 assume true; 3281#L11-1 assume !!(main_~i~0 < main_~j~0); 3282#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3279#L12-2 assume true; 3280#L11-1 [2018-10-27 06:11:05,108 INFO L795 eck$LassoCheckResult]: Loop: 3280#L11-1 assume !!(main_~i~0 < main_~j~0); 3285#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3283#L12-2 assume true; 3281#L11-1 assume !!(main_~i~0 < main_~j~0); 3282#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3279#L12-2 assume true; 3280#L11-1 [2018-10-27 06:11:05,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash -660931426, now seen corresponding path program 16 times [2018-10-27 06:11:05,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:05,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:05,287 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:05,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:05,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:05,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:05,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:05,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:05,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-27 06:11:05,334 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:05,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 13 times [2018-10-27 06:11:05,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,484 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 06:11:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:11:05,491 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 3 Second operand 19 states. [2018-10-27 06:11:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:05,526 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-10-27 06:11:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:11:05,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 64 transitions. [2018-10-27 06:11:05,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:05,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 62 transitions. [2018-10-27 06:11:05,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:05,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:05,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2018-10-27 06:11:05,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:05,529 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-10-27 06:11:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2018-10-27 06:11:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-27 06:11:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 06:11:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-10-27 06:11:05,531 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-27 06:11:05,531 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-27 06:11:05,531 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:11:05,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 60 transitions. [2018-10-27 06:11:05,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:05,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:05,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:05,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 17, 1, 1, 1] [2018-10-27 06:11:05,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:05,532 INFO L793 eck$LassoCheckResult]: Stem: 3576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3569#L12-2 assume true; 3570#L11-1 assume !!(main_~i~0 < main_~j~0); 3573#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3625#L12-2 assume true; 3574#L11-1 assume !!(main_~i~0 < main_~j~0); 3575#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3571#L12-2 assume true; 3572#L11-1 assume !!(main_~i~0 < main_~j~0); 3624#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3623#L12-2 assume true; 3622#L11-1 assume !!(main_~i~0 < main_~j~0); 3621#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3620#L12-2 assume true; 3619#L11-1 assume !!(main_~i~0 < main_~j~0); 3618#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3617#L12-2 assume true; 3616#L11-1 assume !!(main_~i~0 < main_~j~0); 3615#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3614#L12-2 assume true; 3613#L11-1 assume !!(main_~i~0 < main_~j~0); 3612#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3611#L12-2 assume true; 3610#L11-1 assume !!(main_~i~0 < main_~j~0); 3609#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3608#L12-2 assume true; 3607#L11-1 assume !!(main_~i~0 < main_~j~0); 3606#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3605#L12-2 assume true; 3604#L11-1 assume !!(main_~i~0 < main_~j~0); 3603#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3602#L12-2 assume true; 3601#L11-1 assume !!(main_~i~0 < main_~j~0); 3600#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3599#L12-2 assume true; 3598#L11-1 assume !!(main_~i~0 < main_~j~0); 3597#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3596#L12-2 assume true; 3595#L11-1 assume !!(main_~i~0 < main_~j~0); 3594#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3593#L12-2 assume true; 3592#L11-1 assume !!(main_~i~0 < main_~j~0); 3591#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3590#L12-2 assume true; 3589#L11-1 assume !!(main_~i~0 < main_~j~0); 3588#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3587#L12-2 assume true; 3586#L11-1 assume !!(main_~i~0 < main_~j~0); 3585#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3584#L12-2 assume true; 3582#L11-1 assume !!(main_~i~0 < main_~j~0); 3583#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3581#L12-2 assume true; 3579#L11-1 assume !!(main_~i~0 < main_~j~0); 3580#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3577#L12-2 assume true; 3578#L11-1 [2018-10-27 06:11:05,533 INFO L795 eck$LassoCheckResult]: Loop: 3578#L11-1 assume !!(main_~i~0 < main_~j~0); 3583#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3581#L12-2 assume true; 3579#L11-1 assume !!(main_~i~0 < main_~j~0); 3580#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3577#L12-2 assume true; 3578#L11-1 [2018-10-27 06:11:05,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1679862079, now seen corresponding path program 17 times [2018-10-27 06:11:05,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 18 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:06,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:06,586 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:06,592 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:06,609 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-27 06:11:06,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:06,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 18 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-27 06:11:06,648 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:06,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 14 times [2018-10-27 06:11:06,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:06,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:06,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:11:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:11:06,678 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. cyclomatic complexity: 3 Second operand 20 states. [2018-10-27 06:11:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:06,717 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-10-27 06:11:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 06:11:06,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2018-10-27 06:11:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:06,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 65 transitions. [2018-10-27 06:11:06,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:06,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:06,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 65 transitions. [2018-10-27 06:11:06,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:06,719 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-10-27 06:11:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 65 transitions. [2018-10-27 06:11:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-27 06:11:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:11:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-27 06:11:06,721 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-27 06:11:06,721 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-27 06:11:06,722 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:11:06,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 63 transitions. [2018-10-27 06:11:06,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:06,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:06,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:06,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 18, 1, 1, 1] [2018-10-27 06:11:06,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:06,731 INFO L793 eck$LassoCheckResult]: Stem: 3890#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3883#L12-2 assume true; 3884#L11-1 assume !!(main_~i~0 < main_~j~0); 3887#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3942#L12-2 assume true; 3888#L11-1 assume !!(main_~i~0 < main_~j~0); 3889#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3885#L12-2 assume true; 3886#L11-1 assume !!(main_~i~0 < main_~j~0); 3941#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3940#L12-2 assume true; 3939#L11-1 assume !!(main_~i~0 < main_~j~0); 3938#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3937#L12-2 assume true; 3936#L11-1 assume !!(main_~i~0 < main_~j~0); 3935#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3934#L12-2 assume true; 3933#L11-1 assume !!(main_~i~0 < main_~j~0); 3932#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3931#L12-2 assume true; 3930#L11-1 assume !!(main_~i~0 < main_~j~0); 3929#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3928#L12-2 assume true; 3927#L11-1 assume !!(main_~i~0 < main_~j~0); 3926#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3925#L12-2 assume true; 3924#L11-1 assume !!(main_~i~0 < main_~j~0); 3923#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3922#L12-2 assume true; 3921#L11-1 assume !!(main_~i~0 < main_~j~0); 3920#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3919#L12-2 assume true; 3918#L11-1 assume !!(main_~i~0 < main_~j~0); 3917#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3916#L12-2 assume true; 3915#L11-1 assume !!(main_~i~0 < main_~j~0); 3914#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3913#L12-2 assume true; 3912#L11-1 assume !!(main_~i~0 < main_~j~0); 3911#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3910#L12-2 assume true; 3909#L11-1 assume !!(main_~i~0 < main_~j~0); 3908#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3907#L12-2 assume true; 3906#L11-1 assume !!(main_~i~0 < main_~j~0); 3905#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3904#L12-2 assume true; 3903#L11-1 assume !!(main_~i~0 < main_~j~0); 3902#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3901#L12-2 assume true; 3900#L11-1 assume !!(main_~i~0 < main_~j~0); 3899#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3898#L12-2 assume true; 3896#L11-1 assume !!(main_~i~0 < main_~j~0); 3897#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3895#L12-2 assume true; 3893#L11-1 assume !!(main_~i~0 < main_~j~0); 3894#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3891#L12-2 assume true; 3892#L11-1 [2018-10-27 06:11:06,731 INFO L795 eck$LassoCheckResult]: Loop: 3892#L11-1 assume !!(main_~i~0 < main_~j~0); 3897#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 3895#L12-2 assume true; 3893#L11-1 assume !!(main_~i~0 < main_~j~0); 3894#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 3891#L12-2 assume true; 3892#L11-1 [2018-10-27 06:11:06,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 185902526, now seen corresponding path program 18 times [2018-10-27 06:11:06,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:06,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:06,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:06,958 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:06,990 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-10-27 06:11:06,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:06,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:07,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:07,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-27 06:11:07,033 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:07,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 15 times [2018-10-27 06:11:07,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:07,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:07,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:07,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:07,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 06:11:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:11:07,078 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. cyclomatic complexity: 3 Second operand 21 states. [2018-10-27 06:11:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:07,278 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-10-27 06:11:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 06:11:07,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 70 transitions. [2018-10-27 06:11:07,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:07,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 68 transitions. [2018-10-27 06:11:07,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:07,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:07,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2018-10-27 06:11:07,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:07,282 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-10-27 06:11:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2018-10-27 06:11:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-27 06:11:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 06:11:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-10-27 06:11:07,284 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-10-27 06:11:07,284 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-10-27 06:11:07,284 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-10-27 06:11:07,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 66 transitions. [2018-10-27 06:11:07,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:07,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:07,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:07,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 19, 1, 1, 1] [2018-10-27 06:11:07,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:07,286 INFO L793 eck$LassoCheckResult]: Stem: 4219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4213#L12-2 assume true; 4214#L11-1 assume !!(main_~i~0 < main_~j~0); 4217#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4215#L12-2 assume true; 4216#L11-1 assume !!(main_~i~0 < main_~j~0); 4218#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4275#L12-2 assume true; 4274#L11-1 assume !!(main_~i~0 < main_~j~0); 4273#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4272#L12-2 assume true; 4271#L11-1 assume !!(main_~i~0 < main_~j~0); 4270#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4269#L12-2 assume true; 4268#L11-1 assume !!(main_~i~0 < main_~j~0); 4267#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4266#L12-2 assume true; 4265#L11-1 assume !!(main_~i~0 < main_~j~0); 4264#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4263#L12-2 assume true; 4262#L11-1 assume !!(main_~i~0 < main_~j~0); 4261#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4260#L12-2 assume true; 4259#L11-1 assume !!(main_~i~0 < main_~j~0); 4258#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4257#L12-2 assume true; 4256#L11-1 assume !!(main_~i~0 < main_~j~0); 4255#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4254#L12-2 assume true; 4253#L11-1 assume !!(main_~i~0 < main_~j~0); 4252#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4251#L12-2 assume true; 4250#L11-1 assume !!(main_~i~0 < main_~j~0); 4249#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4248#L12-2 assume true; 4247#L11-1 assume !!(main_~i~0 < main_~j~0); 4246#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4245#L12-2 assume true; 4244#L11-1 assume !!(main_~i~0 < main_~j~0); 4243#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4242#L12-2 assume true; 4241#L11-1 assume !!(main_~i~0 < main_~j~0); 4240#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4239#L12-2 assume true; 4238#L11-1 assume !!(main_~i~0 < main_~j~0); 4237#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4236#L12-2 assume true; 4235#L11-1 assume !!(main_~i~0 < main_~j~0); 4234#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4233#L12-2 assume true; 4232#L11-1 assume !!(main_~i~0 < main_~j~0); 4231#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4230#L12-2 assume true; 4229#L11-1 assume !!(main_~i~0 < main_~j~0); 4228#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4227#L12-2 assume true; 4225#L11-1 assume !!(main_~i~0 < main_~j~0); 4226#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4224#L12-2 assume true; 4222#L11-1 assume !!(main_~i~0 < main_~j~0); 4223#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4220#L12-2 assume true; 4221#L11-1 [2018-10-27 06:11:07,286 INFO L795 eck$LassoCheckResult]: Loop: 4221#L11-1 assume !!(main_~i~0 < main_~j~0); 4226#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4224#L12-2 assume true; 4222#L11-1 assume !!(main_~i~0 < main_~j~0); 4223#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4220#L12-2 assume true; 4221#L11-1 [2018-10-27 06:11:07,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2007472545, now seen corresponding path program 19 times [2018-10-27 06:11:07,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:07,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 20 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:07,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:07,558 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:07,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:07,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 20 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:07,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:07,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-27 06:11:07,615 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:07,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 16 times [2018-10-27 06:11:07,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:07,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:07,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:07,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 06:11:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-27 06:11:07,673 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. cyclomatic complexity: 3 Second operand 22 states. [2018-10-27 06:11:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:07,755 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-10-27 06:11:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 06:11:07,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2018-10-27 06:11:07,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:07,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 71 transitions. [2018-10-27 06:11:07,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:07,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:07,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 71 transitions. [2018-10-27 06:11:07,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:07,758 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-10-27 06:11:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 71 transitions. [2018-10-27 06:11:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-27 06:11:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 06:11:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-10-27 06:11:07,760 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-27 06:11:07,760 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-27 06:11:07,760 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-10-27 06:11:07,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2018-10-27 06:11:07,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:07,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:07,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:07,761 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 20, 1, 1, 1] [2018-10-27 06:11:07,761 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:07,761 INFO L793 eck$LassoCheckResult]: Stem: 4566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4559#L12-2 assume true; 4560#L11-1 assume !!(main_~i~0 < main_~j~0); 4563#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4624#L12-2 assume true; 4564#L11-1 assume !!(main_~i~0 < main_~j~0); 4565#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4561#L12-2 assume true; 4562#L11-1 assume !!(main_~i~0 < main_~j~0); 4623#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4622#L12-2 assume true; 4621#L11-1 assume !!(main_~i~0 < main_~j~0); 4620#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4619#L12-2 assume true; 4618#L11-1 assume !!(main_~i~0 < main_~j~0); 4617#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4616#L12-2 assume true; 4615#L11-1 assume !!(main_~i~0 < main_~j~0); 4614#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4613#L12-2 assume true; 4612#L11-1 assume !!(main_~i~0 < main_~j~0); 4611#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4610#L12-2 assume true; 4609#L11-1 assume !!(main_~i~0 < main_~j~0); 4608#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4607#L12-2 assume true; 4606#L11-1 assume !!(main_~i~0 < main_~j~0); 4605#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4604#L12-2 assume true; 4603#L11-1 assume !!(main_~i~0 < main_~j~0); 4602#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4601#L12-2 assume true; 4600#L11-1 assume !!(main_~i~0 < main_~j~0); 4599#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4598#L12-2 assume true; 4597#L11-1 assume !!(main_~i~0 < main_~j~0); 4596#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4595#L12-2 assume true; 4594#L11-1 assume !!(main_~i~0 < main_~j~0); 4593#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4592#L12-2 assume true; 4591#L11-1 assume !!(main_~i~0 < main_~j~0); 4590#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4589#L12-2 assume true; 4588#L11-1 assume !!(main_~i~0 < main_~j~0); 4587#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4586#L12-2 assume true; 4585#L11-1 assume !!(main_~i~0 < main_~j~0); 4584#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4583#L12-2 assume true; 4582#L11-1 assume !!(main_~i~0 < main_~j~0); 4581#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4580#L12-2 assume true; 4579#L11-1 assume !!(main_~i~0 < main_~j~0); 4578#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4577#L12-2 assume true; 4576#L11-1 assume !!(main_~i~0 < main_~j~0); 4575#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4574#L12-2 assume true; 4572#L11-1 assume !!(main_~i~0 < main_~j~0); 4573#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4571#L12-2 assume true; 4569#L11-1 assume !!(main_~i~0 < main_~j~0); 4570#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4567#L12-2 assume true; 4568#L11-1 [2018-10-27 06:11:07,762 INFO L795 eck$LassoCheckResult]: Loop: 4568#L11-1 assume !!(main_~i~0 < main_~j~0); 4573#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4571#L12-2 assume true; 4569#L11-1 assume !!(main_~i~0 < main_~j~0); 4570#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4567#L12-2 assume true; 4568#L11-1 [2018-10-27 06:11:07,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1488123614, now seen corresponding path program 20 times [2018-10-27 06:11:07,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 21 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:07,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:07,990 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:07,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:08,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:08,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:08,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 21 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:08,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-27 06:11:08,088 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:08,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 17 times [2018-10-27 06:11:08,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 06:11:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-27 06:11:08,156 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 3 Second operand 23 states. [2018-10-27 06:11:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:08,199 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-10-27 06:11:08,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 06:11:08,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2018-10-27 06:11:08,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:08,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 72 states and 74 transitions. [2018-10-27 06:11:08,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:08,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:08,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2018-10-27 06:11:08,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:08,202 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-10-27 06:11:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2018-10-27 06:11:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-27 06:11:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 06:11:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-10-27 06:11:08,204 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-10-27 06:11:08,204 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-10-27 06:11:08,204 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-10-27 06:11:08,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 72 transitions. [2018-10-27 06:11:08,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:08,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:08,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:08,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 21, 1, 1, 1] [2018-10-27 06:11:08,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:08,206 INFO L793 eck$LassoCheckResult]: Stem: 4927#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4920#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4921#L12-2 assume true; 4922#L11-1 assume !!(main_~i~0 < main_~j~0); 4923#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4926#L12-2 assume true; 4924#L11-1 assume !!(main_~i~0 < main_~j~0); 4925#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4989#L12-2 assume true; 4988#L11-1 assume !!(main_~i~0 < main_~j~0); 4987#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4986#L12-2 assume true; 4985#L11-1 assume !!(main_~i~0 < main_~j~0); 4984#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4983#L12-2 assume true; 4982#L11-1 assume !!(main_~i~0 < main_~j~0); 4981#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4980#L12-2 assume true; 4979#L11-1 assume !!(main_~i~0 < main_~j~0); 4978#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4977#L12-2 assume true; 4976#L11-1 assume !!(main_~i~0 < main_~j~0); 4975#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4974#L12-2 assume true; 4973#L11-1 assume !!(main_~i~0 < main_~j~0); 4972#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4971#L12-2 assume true; 4970#L11-1 assume !!(main_~i~0 < main_~j~0); 4969#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4968#L12-2 assume true; 4967#L11-1 assume !!(main_~i~0 < main_~j~0); 4966#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4965#L12-2 assume true; 4964#L11-1 assume !!(main_~i~0 < main_~j~0); 4963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4962#L12-2 assume true; 4961#L11-1 assume !!(main_~i~0 < main_~j~0); 4960#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4959#L12-2 assume true; 4958#L11-1 assume !!(main_~i~0 < main_~j~0); 4957#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4956#L12-2 assume true; 4955#L11-1 assume !!(main_~i~0 < main_~j~0); 4954#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4953#L12-2 assume true; 4952#L11-1 assume !!(main_~i~0 < main_~j~0); 4951#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4950#L12-2 assume true; 4949#L11-1 assume !!(main_~i~0 < main_~j~0); 4948#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4947#L12-2 assume true; 4946#L11-1 assume !!(main_~i~0 < main_~j~0); 4945#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4944#L12-2 assume true; 4943#L11-1 assume !!(main_~i~0 < main_~j~0); 4942#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4941#L12-2 assume true; 4940#L11-1 assume !!(main_~i~0 < main_~j~0); 4939#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4938#L12-2 assume true; 4937#L11-1 assume !!(main_~i~0 < main_~j~0); 4936#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4935#L12-2 assume true; 4933#L11-1 assume !!(main_~i~0 < main_~j~0); 4934#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4932#L12-2 assume true; 4930#L11-1 assume !!(main_~i~0 < main_~j~0); 4931#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4928#L12-2 assume true; 4929#L11-1 [2018-10-27 06:11:08,206 INFO L795 eck$LassoCheckResult]: Loop: 4929#L11-1 assume !!(main_~i~0 < main_~j~0); 4934#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 4932#L12-2 assume true; 4930#L11-1 assume !!(main_~i~0 < main_~j~0); 4931#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 4928#L12-2 assume true; 4929#L11-1 [2018-10-27 06:11:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash 36320385, now seen corresponding path program 21 times [2018-10-27 06:11:08,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 22 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:08,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:08,528 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:08,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-10-27 06:11:08,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:08,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 22 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:08,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:08,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-27 06:11:08,595 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 18 times [2018-10-27 06:11:08,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 06:11:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-27 06:11:08,627 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. cyclomatic complexity: 3 Second operand 24 states. [2018-10-27 06:11:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:08,724 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-10-27 06:11:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 06:11:08,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2018-10-27 06:11:08,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:08,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 75 states and 77 transitions. [2018-10-27 06:11:08,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:08,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:08,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2018-10-27 06:11:08,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:08,727 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-27 06:11:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2018-10-27 06:11:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-27 06:11:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 06:11:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-10-27 06:11:08,728 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-27 06:11:08,728 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-27 06:11:08,729 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-10-27 06:11:08,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2018-10-27 06:11:08,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:08,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:08,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:08,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 22, 1, 1, 1] [2018-10-27 06:11:08,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:08,730 INFO L793 eck$LassoCheckResult]: Stem: 5306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5299#L12-2 assume true; 5300#L11-1 assume !!(main_~i~0 < main_~j~0); 5301#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5370#L12-2 assume true; 5302#L11-1 assume !!(main_~i~0 < main_~j~0); 5303#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5304#L12-2 assume true; 5305#L11-1 assume !!(main_~i~0 < main_~j~0); 5369#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5368#L12-2 assume true; 5367#L11-1 assume !!(main_~i~0 < main_~j~0); 5366#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5365#L12-2 assume true; 5364#L11-1 assume !!(main_~i~0 < main_~j~0); 5363#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5362#L12-2 assume true; 5361#L11-1 assume !!(main_~i~0 < main_~j~0); 5360#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5359#L12-2 assume true; 5358#L11-1 assume !!(main_~i~0 < main_~j~0); 5357#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5356#L12-2 assume true; 5355#L11-1 assume !!(main_~i~0 < main_~j~0); 5354#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5353#L12-2 assume true; 5352#L11-1 assume !!(main_~i~0 < main_~j~0); 5351#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5350#L12-2 assume true; 5349#L11-1 assume !!(main_~i~0 < main_~j~0); 5348#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5347#L12-2 assume true; 5346#L11-1 assume !!(main_~i~0 < main_~j~0); 5345#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5344#L12-2 assume true; 5343#L11-1 assume !!(main_~i~0 < main_~j~0); 5342#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5341#L12-2 assume true; 5340#L11-1 assume !!(main_~i~0 < main_~j~0); 5339#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5338#L12-2 assume true; 5337#L11-1 assume !!(main_~i~0 < main_~j~0); 5336#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5335#L12-2 assume true; 5334#L11-1 assume !!(main_~i~0 < main_~j~0); 5333#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5332#L12-2 assume true; 5331#L11-1 assume !!(main_~i~0 < main_~j~0); 5330#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5329#L12-2 assume true; 5328#L11-1 assume !!(main_~i~0 < main_~j~0); 5327#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5326#L12-2 assume true; 5325#L11-1 assume !!(main_~i~0 < main_~j~0); 5324#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5323#L12-2 assume true; 5322#L11-1 assume !!(main_~i~0 < main_~j~0); 5321#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5320#L12-2 assume true; 5319#L11-1 assume !!(main_~i~0 < main_~j~0); 5318#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5317#L12-2 assume true; 5316#L11-1 assume !!(main_~i~0 < main_~j~0); 5315#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5314#L12-2 assume true; 5312#L11-1 assume !!(main_~i~0 < main_~j~0); 5313#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5311#L12-2 assume true; 5309#L11-1 assume !!(main_~i~0 < main_~j~0); 5310#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 5307#L12-2 assume true; 5308#L11-1 [2018-10-27 06:11:08,730 INFO L795 eck$LassoCheckResult]: Loop: 5308#L11-1 assume !!(main_~i~0 < main_~j~0); 5313#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5311#L12-2 assume true; 5309#L11-1 assume !!(main_~i~0 < main_~j~0); 5310#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 5307#L12-2 assume true; 5308#L11-1 [2018-10-27 06:11:08,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -313004034, now seen corresponding path program 22 times [2018-10-27 06:11:08,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:08,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 23 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:09,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:09,009 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:09,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:09,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:09,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:09,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 23 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:09,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-27 06:11:09,075 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 19 times [2018-10-27 06:11:09,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:11:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:11:09,130 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand 25 states. [2018-10-27 06:11:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:09,185 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-10-27 06:11:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 06:11:09,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 82 transitions. [2018-10-27 06:11:09,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:09,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 80 transitions. [2018-10-27 06:11:09,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:09,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:09,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2018-10-27 06:11:09,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:09,188 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-10-27 06:11:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2018-10-27 06:11:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-27 06:11:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 06:11:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-10-27 06:11:09,190 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-10-27 06:11:09,190 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-10-27 06:11:09,190 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-10-27 06:11:09,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 78 transitions. [2018-10-27 06:11:09,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:09,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:09,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:09,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [25, 24, 23, 1, 1, 1] [2018-10-27 06:11:09,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:09,192 INFO L793 eck$LassoCheckResult]: Stem: 5700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5693#L12-2 assume true; 5694#L11-1 assume !!(main_~i~0 < main_~j~0); 5697#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5767#L12-2 assume true; 5698#L11-1 assume !!(main_~i~0 < main_~j~0); 5699#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5695#L12-2 assume true; 5696#L11-1 assume !!(main_~i~0 < main_~j~0); 5766#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5765#L12-2 assume true; 5764#L11-1 assume !!(main_~i~0 < main_~j~0); 5763#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5762#L12-2 assume true; 5761#L11-1 assume !!(main_~i~0 < main_~j~0); 5760#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5759#L12-2 assume true; 5758#L11-1 assume !!(main_~i~0 < main_~j~0); 5757#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5756#L12-2 assume true; 5755#L11-1 assume !!(main_~i~0 < main_~j~0); 5754#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5753#L12-2 assume true; 5752#L11-1 assume !!(main_~i~0 < main_~j~0); 5751#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5750#L12-2 assume true; 5749#L11-1 assume !!(main_~i~0 < main_~j~0); 5748#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5747#L12-2 assume true; 5746#L11-1 assume !!(main_~i~0 < main_~j~0); 5745#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5744#L12-2 assume true; 5743#L11-1 assume !!(main_~i~0 < main_~j~0); 5742#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5741#L12-2 assume true; 5740#L11-1 assume !!(main_~i~0 < main_~j~0); 5739#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5738#L12-2 assume true; 5737#L11-1 assume !!(main_~i~0 < main_~j~0); 5736#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5735#L12-2 assume true; 5734#L11-1 assume !!(main_~i~0 < main_~j~0); 5733#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5732#L12-2 assume true; 5731#L11-1 assume !!(main_~i~0 < main_~j~0); 5730#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5729#L12-2 assume true; 5728#L11-1 assume !!(main_~i~0 < main_~j~0); 5727#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5726#L12-2 assume true; 5725#L11-1 assume !!(main_~i~0 < main_~j~0); 5724#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5723#L12-2 assume true; 5722#L11-1 assume !!(main_~i~0 < main_~j~0); 5721#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5720#L12-2 assume true; 5719#L11-1 assume !!(main_~i~0 < main_~j~0); 5718#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5717#L12-2 assume true; 5716#L11-1 assume !!(main_~i~0 < main_~j~0); 5715#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5714#L12-2 assume true; 5713#L11-1 assume !!(main_~i~0 < main_~j~0); 5712#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5711#L12-2 assume true; 5710#L11-1 assume !!(main_~i~0 < main_~j~0); 5709#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5708#L12-2 assume true; 5706#L11-1 assume !!(main_~i~0 < main_~j~0); 5707#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5705#L12-2 assume true; 5703#L11-1 assume !!(main_~i~0 < main_~j~0); 5704#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 5701#L12-2 assume true; 5702#L11-1 [2018-10-27 06:11:09,192 INFO L795 eck$LassoCheckResult]: Loop: 5702#L11-1 assume !!(main_~i~0 < main_~j~0); 5707#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 5705#L12-2 assume true; 5703#L11-1 assume !!(main_~i~0 < main_~j~0); 5704#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 5701#L12-2 assume true; 5702#L11-1 [2018-10-27 06:11:09,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash -331012255, now seen corresponding path program 23 times [2018-10-27 06:11:09,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 24 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:09,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:09,475 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:09,507 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-27 06:11:09,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:09,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 24 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:09,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-27 06:11:09,546 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:09,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 20 times [2018-10-27 06:11:09,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:09,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:09,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 06:11:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-27 06:11:09,576 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. cyclomatic complexity: 3 Second operand 26 states. [2018-10-27 06:11:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:09,617 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-10-27 06:11:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 06:11:09,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2018-10-27 06:11:09,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:09,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 81 states and 83 transitions. [2018-10-27 06:11:09,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:09,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:09,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 83 transitions. [2018-10-27 06:11:09,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:09,620 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-10-27 06:11:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 83 transitions. [2018-10-27 06:11:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-27 06:11:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 06:11:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-10-27 06:11:09,621 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-10-27 06:11:09,621 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-10-27 06:11:09,621 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-10-27 06:11:09,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2018-10-27 06:11:09,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:09,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:09,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:09,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 24, 1, 1, 1] [2018-10-27 06:11:09,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:09,628 INFO L793 eck$LassoCheckResult]: Stem: 6110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6103#L12-2 assume true; 6104#L11-1 assume !!(main_~i~0 < main_~j~0); 6107#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6180#L12-2 assume true; 6108#L11-1 assume !!(main_~i~0 < main_~j~0); 6109#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6105#L12-2 assume true; 6106#L11-1 assume !!(main_~i~0 < main_~j~0); 6179#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6178#L12-2 assume true; 6177#L11-1 assume !!(main_~i~0 < main_~j~0); 6176#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6175#L12-2 assume true; 6174#L11-1 assume !!(main_~i~0 < main_~j~0); 6173#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6172#L12-2 assume true; 6171#L11-1 assume !!(main_~i~0 < main_~j~0); 6170#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6169#L12-2 assume true; 6168#L11-1 assume !!(main_~i~0 < main_~j~0); 6167#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6166#L12-2 assume true; 6165#L11-1 assume !!(main_~i~0 < main_~j~0); 6164#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6163#L12-2 assume true; 6162#L11-1 assume !!(main_~i~0 < main_~j~0); 6161#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6160#L12-2 assume true; 6159#L11-1 assume !!(main_~i~0 < main_~j~0); 6158#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6157#L12-2 assume true; 6156#L11-1 assume !!(main_~i~0 < main_~j~0); 6155#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6154#L12-2 assume true; 6153#L11-1 assume !!(main_~i~0 < main_~j~0); 6152#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6151#L12-2 assume true; 6150#L11-1 assume !!(main_~i~0 < main_~j~0); 6149#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6148#L12-2 assume true; 6147#L11-1 assume !!(main_~i~0 < main_~j~0); 6146#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6145#L12-2 assume true; 6144#L11-1 assume !!(main_~i~0 < main_~j~0); 6143#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6142#L12-2 assume true; 6141#L11-1 assume !!(main_~i~0 < main_~j~0); 6140#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6139#L12-2 assume true; 6138#L11-1 assume !!(main_~i~0 < main_~j~0); 6137#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6136#L12-2 assume true; 6135#L11-1 assume !!(main_~i~0 < main_~j~0); 6134#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6133#L12-2 assume true; 6132#L11-1 assume !!(main_~i~0 < main_~j~0); 6131#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6130#L12-2 assume true; 6129#L11-1 assume !!(main_~i~0 < main_~j~0); 6128#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6127#L12-2 assume true; 6126#L11-1 assume !!(main_~i~0 < main_~j~0); 6125#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6124#L12-2 assume true; 6123#L11-1 assume !!(main_~i~0 < main_~j~0); 6122#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6121#L12-2 assume true; 6120#L11-1 assume !!(main_~i~0 < main_~j~0); 6119#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6118#L12-2 assume true; 6116#L11-1 assume !!(main_~i~0 < main_~j~0); 6117#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6115#L12-2 assume true; 6113#L11-1 assume !!(main_~i~0 < main_~j~0); 6114#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6111#L12-2 assume true; 6112#L11-1 [2018-10-27 06:11:09,628 INFO L795 eck$LassoCheckResult]: Loop: 6112#L11-1 assume !!(main_~i~0 < main_~j~0); 6117#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6115#L12-2 assume true; 6113#L11-1 assume !!(main_~i~0 < main_~j~0); 6114#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6111#L12-2 assume true; 6112#L11-1 [2018-10-27 06:11:09,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 56987934, now seen corresponding path program 24 times [2018-10-27 06:11:09,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:09,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 25 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:10,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:10,442 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:10,478 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-10-27 06:11:10,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:10,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 25 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-27 06:11:10,515 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:10,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 21 times [2018-10-27 06:11:10,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:10,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:10,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:10,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:10,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:10,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 06:11:10,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-27 06:11:10,553 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 3 Second operand 27 states. [2018-10-27 06:11:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:10,631 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-10-27 06:11:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 06:11:10,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 88 transitions. [2018-10-27 06:11:10,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:10,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 86 transitions. [2018-10-27 06:11:10,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:10,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:10,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2018-10-27 06:11:10,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:10,633 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-10-27 06:11:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2018-10-27 06:11:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-27 06:11:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 06:11:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-10-27 06:11:10,635 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-10-27 06:11:10,635 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-10-27 06:11:10,635 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-10-27 06:11:10,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 84 transitions. [2018-10-27 06:11:10,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:10,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:10,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:10,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 26, 25, 1, 1, 1] [2018-10-27 06:11:10,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:10,636 INFO L793 eck$LassoCheckResult]: Stem: 6536#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6529#L12-2 assume true; 6530#L11-1 assume !!(main_~i~0 < main_~j~0); 6533#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6609#L12-2 assume true; 6534#L11-1 assume !!(main_~i~0 < main_~j~0); 6535#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6531#L12-2 assume true; 6532#L11-1 assume !!(main_~i~0 < main_~j~0); 6608#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6607#L12-2 assume true; 6606#L11-1 assume !!(main_~i~0 < main_~j~0); 6605#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6604#L12-2 assume true; 6603#L11-1 assume !!(main_~i~0 < main_~j~0); 6602#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6601#L12-2 assume true; 6600#L11-1 assume !!(main_~i~0 < main_~j~0); 6599#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6598#L12-2 assume true; 6597#L11-1 assume !!(main_~i~0 < main_~j~0); 6596#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6595#L12-2 assume true; 6594#L11-1 assume !!(main_~i~0 < main_~j~0); 6593#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6592#L12-2 assume true; 6591#L11-1 assume !!(main_~i~0 < main_~j~0); 6590#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6589#L12-2 assume true; 6588#L11-1 assume !!(main_~i~0 < main_~j~0); 6587#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6586#L12-2 assume true; 6585#L11-1 assume !!(main_~i~0 < main_~j~0); 6584#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6583#L12-2 assume true; 6582#L11-1 assume !!(main_~i~0 < main_~j~0); 6581#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6580#L12-2 assume true; 6579#L11-1 assume !!(main_~i~0 < main_~j~0); 6578#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6577#L12-2 assume true; 6576#L11-1 assume !!(main_~i~0 < main_~j~0); 6575#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6574#L12-2 assume true; 6573#L11-1 assume !!(main_~i~0 < main_~j~0); 6572#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6571#L12-2 assume true; 6570#L11-1 assume !!(main_~i~0 < main_~j~0); 6569#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6568#L12-2 assume true; 6567#L11-1 assume !!(main_~i~0 < main_~j~0); 6566#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6565#L12-2 assume true; 6564#L11-1 assume !!(main_~i~0 < main_~j~0); 6563#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6562#L12-2 assume true; 6561#L11-1 assume !!(main_~i~0 < main_~j~0); 6560#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6559#L12-2 assume true; 6558#L11-1 assume !!(main_~i~0 < main_~j~0); 6557#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6556#L12-2 assume true; 6555#L11-1 assume !!(main_~i~0 < main_~j~0); 6554#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6553#L12-2 assume true; 6552#L11-1 assume !!(main_~i~0 < main_~j~0); 6551#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6550#L12-2 assume true; 6549#L11-1 assume !!(main_~i~0 < main_~j~0); 6548#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6547#L12-2 assume true; 6546#L11-1 assume !!(main_~i~0 < main_~j~0); 6545#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6544#L12-2 assume true; 6542#L11-1 assume !!(main_~i~0 < main_~j~0); 6543#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6541#L12-2 assume true; 6539#L11-1 assume !!(main_~i~0 < main_~j~0); 6540#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6537#L12-2 assume true; 6538#L11-1 [2018-10-27 06:11:10,636 INFO L795 eck$LassoCheckResult]: Loop: 6538#L11-1 assume !!(main_~i~0 < main_~j~0); 6543#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6541#L12-2 assume true; 6539#L11-1 assume !!(main_~i~0 < main_~j~0); 6540#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6537#L12-2 assume true; 6538#L11-1 [2018-10-27 06:11:10,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1213624897, now seen corresponding path program 25 times [2018-10-27 06:11:10,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:10,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 26 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:11,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:11,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:11,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 26 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:11,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:11,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-27 06:11:11,130 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:11,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 22 times [2018-10-27 06:11:11,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:11,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 06:11:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-27 06:11:11,160 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. cyclomatic complexity: 3 Second operand 28 states. [2018-10-27 06:11:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:11,211 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-10-27 06:11:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 06:11:11,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2018-10-27 06:11:11,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:11,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 89 transitions. [2018-10-27 06:11:11,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:11,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:11,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 89 transitions. [2018-10-27 06:11:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:11,214 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-10-27 06:11:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 89 transitions. [2018-10-27 06:11:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-27 06:11:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 06:11:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-10-27 06:11:11,216 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-10-27 06:11:11,216 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-10-27 06:11:11,216 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-10-27 06:11:11,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2018-10-27 06:11:11,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:11,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:11,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:11,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 26, 1, 1, 1] [2018-10-27 06:11:11,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:11,217 INFO L793 eck$LassoCheckResult]: Stem: 6978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6971#L12-2 assume true; 6972#L11-1 assume !!(main_~i~0 < main_~j~0); 6975#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7054#L12-2 assume true; 6976#L11-1 assume !!(main_~i~0 < main_~j~0); 6977#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6973#L12-2 assume true; 6974#L11-1 assume !!(main_~i~0 < main_~j~0); 7053#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7052#L12-2 assume true; 7051#L11-1 assume !!(main_~i~0 < main_~j~0); 7050#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7049#L12-2 assume true; 7048#L11-1 assume !!(main_~i~0 < main_~j~0); 7047#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7046#L12-2 assume true; 7045#L11-1 assume !!(main_~i~0 < main_~j~0); 7044#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7043#L12-2 assume true; 7042#L11-1 assume !!(main_~i~0 < main_~j~0); 7041#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7040#L12-2 assume true; 7039#L11-1 assume !!(main_~i~0 < main_~j~0); 7038#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7037#L12-2 assume true; 7036#L11-1 assume !!(main_~i~0 < main_~j~0); 7035#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7034#L12-2 assume true; 7033#L11-1 assume !!(main_~i~0 < main_~j~0); 7032#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7031#L12-2 assume true; 7030#L11-1 assume !!(main_~i~0 < main_~j~0); 7029#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7028#L12-2 assume true; 7027#L11-1 assume !!(main_~i~0 < main_~j~0); 7026#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7025#L12-2 assume true; 7024#L11-1 assume !!(main_~i~0 < main_~j~0); 7023#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7022#L12-2 assume true; 7021#L11-1 assume !!(main_~i~0 < main_~j~0); 7020#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7019#L12-2 assume true; 7018#L11-1 assume !!(main_~i~0 < main_~j~0); 7017#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7016#L12-2 assume true; 7015#L11-1 assume !!(main_~i~0 < main_~j~0); 7014#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7013#L12-2 assume true; 7012#L11-1 assume !!(main_~i~0 < main_~j~0); 7011#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7010#L12-2 assume true; 7009#L11-1 assume !!(main_~i~0 < main_~j~0); 7008#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7007#L12-2 assume true; 7006#L11-1 assume !!(main_~i~0 < main_~j~0); 7005#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7004#L12-2 assume true; 7003#L11-1 assume !!(main_~i~0 < main_~j~0); 7002#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7001#L12-2 assume true; 7000#L11-1 assume !!(main_~i~0 < main_~j~0); 6999#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6998#L12-2 assume true; 6997#L11-1 assume !!(main_~i~0 < main_~j~0); 6996#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6995#L12-2 assume true; 6994#L11-1 assume !!(main_~i~0 < main_~j~0); 6993#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6992#L12-2 assume true; 6991#L11-1 assume !!(main_~i~0 < main_~j~0); 6990#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6989#L12-2 assume true; 6988#L11-1 assume !!(main_~i~0 < main_~j~0); 6987#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6986#L12-2 assume true; 6984#L11-1 assume !!(main_~i~0 < main_~j~0); 6985#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6983#L12-2 assume true; 6981#L11-1 assume !!(main_~i~0 < main_~j~0); 6982#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6979#L12-2 assume true; 6980#L11-1 [2018-10-27 06:11:11,217 INFO L795 eck$LassoCheckResult]: Loop: 6980#L11-1 assume !!(main_~i~0 < main_~j~0); 6985#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 6983#L12-2 assume true; 6981#L11-1 assume !!(main_~i~0 < main_~j~0); 6982#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 6979#L12-2 assume true; 6980#L11-1 [2018-10-27 06:11:11,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash 62773822, now seen corresponding path program 26 times [2018-10-27 06:11:11,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 27 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:11,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:11,822 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:11,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:11,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:11,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:11,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 27 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:11,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:11,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-27 06:11:11,879 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:11,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 23 times [2018-10-27 06:11:11,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:11,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:11,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:11,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 06:11:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:11:11,908 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 3 Second operand 29 states. [2018-10-27 06:11:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:11,960 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-10-27 06:11:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 06:11:11,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 94 transitions. [2018-10-27 06:11:11,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:11,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 90 states and 92 transitions. [2018-10-27 06:11:11,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:11,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:11,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2018-10-27 06:11:11,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:11,963 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-10-27 06:11:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2018-10-27 06:11:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-27 06:11:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-27 06:11:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-10-27 06:11:11,965 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-10-27 06:11:11,965 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-10-27 06:11:11,965 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-10-27 06:11:11,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 90 transitions. [2018-10-27 06:11:11,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:11,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:11,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:11,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 27, 1, 1, 1] [2018-10-27 06:11:11,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:11,967 INFO L793 eck$LassoCheckResult]: Stem: 7435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7429#L12-2 assume true; 7430#L11-1 assume !!(main_~i~0 < main_~j~0); 7433#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7431#L12-2 assume true; 7432#L11-1 assume !!(main_~i~0 < main_~j~0); 7434#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7515#L12-2 assume true; 7514#L11-1 assume !!(main_~i~0 < main_~j~0); 7513#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7512#L12-2 assume true; 7511#L11-1 assume !!(main_~i~0 < main_~j~0); 7510#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7509#L12-2 assume true; 7508#L11-1 assume !!(main_~i~0 < main_~j~0); 7507#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7506#L12-2 assume true; 7505#L11-1 assume !!(main_~i~0 < main_~j~0); 7504#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7503#L12-2 assume true; 7502#L11-1 assume !!(main_~i~0 < main_~j~0); 7501#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7500#L12-2 assume true; 7499#L11-1 assume !!(main_~i~0 < main_~j~0); 7498#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7497#L12-2 assume true; 7496#L11-1 assume !!(main_~i~0 < main_~j~0); 7495#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7494#L12-2 assume true; 7493#L11-1 assume !!(main_~i~0 < main_~j~0); 7492#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7491#L12-2 assume true; 7490#L11-1 assume !!(main_~i~0 < main_~j~0); 7489#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7488#L12-2 assume true; 7487#L11-1 assume !!(main_~i~0 < main_~j~0); 7486#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7485#L12-2 assume true; 7484#L11-1 assume !!(main_~i~0 < main_~j~0); 7483#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7482#L12-2 assume true; 7481#L11-1 assume !!(main_~i~0 < main_~j~0); 7480#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7479#L12-2 assume true; 7478#L11-1 assume !!(main_~i~0 < main_~j~0); 7477#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7476#L12-2 assume true; 7475#L11-1 assume !!(main_~i~0 < main_~j~0); 7474#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7473#L12-2 assume true; 7472#L11-1 assume !!(main_~i~0 < main_~j~0); 7471#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7470#L12-2 assume true; 7469#L11-1 assume !!(main_~i~0 < main_~j~0); 7468#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7467#L12-2 assume true; 7466#L11-1 assume !!(main_~i~0 < main_~j~0); 7465#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7464#L12-2 assume true; 7463#L11-1 assume !!(main_~i~0 < main_~j~0); 7462#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7461#L12-2 assume true; 7460#L11-1 assume !!(main_~i~0 < main_~j~0); 7459#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7458#L12-2 assume true; 7457#L11-1 assume !!(main_~i~0 < main_~j~0); 7456#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7455#L12-2 assume true; 7454#L11-1 assume !!(main_~i~0 < main_~j~0); 7453#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7452#L12-2 assume true; 7451#L11-1 assume !!(main_~i~0 < main_~j~0); 7450#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7449#L12-2 assume true; 7448#L11-1 assume !!(main_~i~0 < main_~j~0); 7447#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7446#L12-2 assume true; 7445#L11-1 assume !!(main_~i~0 < main_~j~0); 7444#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7443#L12-2 assume true; 7441#L11-1 assume !!(main_~i~0 < main_~j~0); 7442#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7440#L12-2 assume true; 7438#L11-1 assume !!(main_~i~0 < main_~j~0); 7439#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 7436#L12-2 assume true; 7437#L11-1 [2018-10-27 06:11:11,967 INFO L795 eck$LassoCheckResult]: Loop: 7437#L11-1 assume !!(main_~i~0 < main_~j~0); 7442#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7440#L12-2 assume true; 7438#L11-1 assume !!(main_~i~0 < main_~j~0); 7439#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 7436#L12-2 assume true; 7437#L11-1 [2018-10-27 06:11:11,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1782322465, now seen corresponding path program 27 times [2018-10-27 06:11:11,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:11,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 28 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:12,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:12,390 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:12,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-10-27 06:11:12,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:12,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 28 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-27 06:11:12,469 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:12,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 24 times [2018-10-27 06:11:12,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:12,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:12,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 06:11:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-27 06:11:12,512 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. cyclomatic complexity: 3 Second operand 30 states. [2018-10-27 06:11:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:12,564 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-10-27 06:11:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 06:11:12,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2018-10-27 06:11:12,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:12,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 93 states and 95 transitions. [2018-10-27 06:11:12,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:12,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 95 transitions. [2018-10-27 06:11:12,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:12,567 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-10-27 06:11:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 95 transitions. [2018-10-27 06:11:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-27 06:11:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 06:11:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-27 06:11:12,568 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-27 06:11:12,568 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-27 06:11:12,568 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-10-27 06:11:12,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2018-10-27 06:11:12,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:12,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:12,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:12,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [30, 29, 28, 1, 1, 1] [2018-10-27 06:11:12,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:12,570 INFO L793 eck$LassoCheckResult]: Stem: 7910#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7903#L12-2 assume true; 7904#L11-1 assume !!(main_~i~0 < main_~j~0); 7907#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7992#L12-2 assume true; 7908#L11-1 assume !!(main_~i~0 < main_~j~0); 7909#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7905#L12-2 assume true; 7906#L11-1 assume !!(main_~i~0 < main_~j~0); 7991#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7990#L12-2 assume true; 7989#L11-1 assume !!(main_~i~0 < main_~j~0); 7988#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7987#L12-2 assume true; 7986#L11-1 assume !!(main_~i~0 < main_~j~0); 7985#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7984#L12-2 assume true; 7983#L11-1 assume !!(main_~i~0 < main_~j~0); 7982#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7981#L12-2 assume true; 7980#L11-1 assume !!(main_~i~0 < main_~j~0); 7979#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7978#L12-2 assume true; 7977#L11-1 assume !!(main_~i~0 < main_~j~0); 7976#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7975#L12-2 assume true; 7974#L11-1 assume !!(main_~i~0 < main_~j~0); 7973#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7972#L12-2 assume true; 7971#L11-1 assume !!(main_~i~0 < main_~j~0); 7970#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7969#L12-2 assume true; 7968#L11-1 assume !!(main_~i~0 < main_~j~0); 7967#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7966#L12-2 assume true; 7965#L11-1 assume !!(main_~i~0 < main_~j~0); 7964#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7963#L12-2 assume true; 7962#L11-1 assume !!(main_~i~0 < main_~j~0); 7961#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7960#L12-2 assume true; 7959#L11-1 assume !!(main_~i~0 < main_~j~0); 7958#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7957#L12-2 assume true; 7956#L11-1 assume !!(main_~i~0 < main_~j~0); 7955#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7954#L12-2 assume true; 7953#L11-1 assume !!(main_~i~0 < main_~j~0); 7952#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7951#L12-2 assume true; 7950#L11-1 assume !!(main_~i~0 < main_~j~0); 7949#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7948#L12-2 assume true; 7947#L11-1 assume !!(main_~i~0 < main_~j~0); 7946#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7945#L12-2 assume true; 7944#L11-1 assume !!(main_~i~0 < main_~j~0); 7943#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7942#L12-2 assume true; 7941#L11-1 assume !!(main_~i~0 < main_~j~0); 7940#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7939#L12-2 assume true; 7938#L11-1 assume !!(main_~i~0 < main_~j~0); 7937#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7936#L12-2 assume true; 7935#L11-1 assume !!(main_~i~0 < main_~j~0); 7934#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7933#L12-2 assume true; 7932#L11-1 assume !!(main_~i~0 < main_~j~0); 7931#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7930#L12-2 assume true; 7929#L11-1 assume !!(main_~i~0 < main_~j~0); 7928#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7927#L12-2 assume true; 7926#L11-1 assume !!(main_~i~0 < main_~j~0); 7925#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7924#L12-2 assume true; 7923#L11-1 assume !!(main_~i~0 < main_~j~0); 7922#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7921#L12-2 assume true; 7920#L11-1 assume !!(main_~i~0 < main_~j~0); 7919#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7918#L12-2 assume true; 7916#L11-1 assume !!(main_~i~0 < main_~j~0); 7917#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7915#L12-2 assume true; 7913#L11-1 assume !!(main_~i~0 < main_~j~0); 7914#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 7911#L12-2 assume true; 7912#L11-1 [2018-10-27 06:11:12,570 INFO L795 eck$LassoCheckResult]: Loop: 7912#L11-1 assume !!(main_~i~0 < main_~j~0); 7917#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 7915#L12-2 assume true; 7913#L11-1 assume !!(main_~i~0 < main_~j~0); 7914#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 7911#L12-2 assume true; 7912#L11-1 [2018-10-27 06:11:12,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1513960610, now seen corresponding path program 28 times [2018-10-27 06:11:12,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:12,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 29 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:13,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:13,058 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:13,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:13,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:13,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:13,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 29 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:13,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:13,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-27 06:11:13,120 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:13,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 25 times [2018-10-27 06:11:13,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,246 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 06:11:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-27 06:11:13,253 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 3 Second operand 31 states. [2018-10-27 06:11:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:13,312 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-10-27 06:11:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 06:11:13,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 100 transitions. [2018-10-27 06:11:13,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:13,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 96 states and 98 transitions. [2018-10-27 06:11:13,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:13,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:13,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2018-10-27 06:11:13,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:13,314 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-10-27 06:11:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2018-10-27 06:11:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-27 06:11:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 06:11:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-10-27 06:11:13,316 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-10-27 06:11:13,316 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-10-27 06:11:13,316 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-10-27 06:11:13,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 96 transitions. [2018-10-27 06:11:13,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:13,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:13,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:13,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 29, 1, 1, 1] [2018-10-27 06:11:13,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:13,317 INFO L793 eck$LassoCheckResult]: Stem: 8400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8392#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8393#L12-2 assume true; 8394#L11-1 assume !!(main_~i~0 < main_~j~0); 8397#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8485#L12-2 assume true; 8398#L11-1 assume !!(main_~i~0 < main_~j~0); 8399#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8395#L12-2 assume true; 8396#L11-1 assume !!(main_~i~0 < main_~j~0); 8484#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8483#L12-2 assume true; 8482#L11-1 assume !!(main_~i~0 < main_~j~0); 8481#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8480#L12-2 assume true; 8479#L11-1 assume !!(main_~i~0 < main_~j~0); 8478#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8477#L12-2 assume true; 8476#L11-1 assume !!(main_~i~0 < main_~j~0); 8475#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8474#L12-2 assume true; 8473#L11-1 assume !!(main_~i~0 < main_~j~0); 8472#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8471#L12-2 assume true; 8470#L11-1 assume !!(main_~i~0 < main_~j~0); 8469#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8468#L12-2 assume true; 8467#L11-1 assume !!(main_~i~0 < main_~j~0); 8466#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8465#L12-2 assume true; 8464#L11-1 assume !!(main_~i~0 < main_~j~0); 8463#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8462#L12-2 assume true; 8461#L11-1 assume !!(main_~i~0 < main_~j~0); 8460#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8459#L12-2 assume true; 8458#L11-1 assume !!(main_~i~0 < main_~j~0); 8457#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8456#L12-2 assume true; 8455#L11-1 assume !!(main_~i~0 < main_~j~0); 8454#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8453#L12-2 assume true; 8452#L11-1 assume !!(main_~i~0 < main_~j~0); 8451#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8450#L12-2 assume true; 8449#L11-1 assume !!(main_~i~0 < main_~j~0); 8448#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8447#L12-2 assume true; 8446#L11-1 assume !!(main_~i~0 < main_~j~0); 8445#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8444#L12-2 assume true; 8443#L11-1 assume !!(main_~i~0 < main_~j~0); 8442#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8441#L12-2 assume true; 8440#L11-1 assume !!(main_~i~0 < main_~j~0); 8439#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8438#L12-2 assume true; 8437#L11-1 assume !!(main_~i~0 < main_~j~0); 8436#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8435#L12-2 assume true; 8434#L11-1 assume !!(main_~i~0 < main_~j~0); 8433#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8432#L12-2 assume true; 8431#L11-1 assume !!(main_~i~0 < main_~j~0); 8430#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8429#L12-2 assume true; 8428#L11-1 assume !!(main_~i~0 < main_~j~0); 8427#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8426#L12-2 assume true; 8425#L11-1 assume !!(main_~i~0 < main_~j~0); 8424#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8423#L12-2 assume true; 8422#L11-1 assume !!(main_~i~0 < main_~j~0); 8421#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8420#L12-2 assume true; 8419#L11-1 assume !!(main_~i~0 < main_~j~0); 8418#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8417#L12-2 assume true; 8416#L11-1 assume !!(main_~i~0 < main_~j~0); 8415#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8414#L12-2 assume true; 8413#L11-1 assume !!(main_~i~0 < main_~j~0); 8412#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8411#L12-2 assume true; 8410#L11-1 assume !!(main_~i~0 < main_~j~0); 8409#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8408#L12-2 assume true; 8406#L11-1 assume !!(main_~i~0 < main_~j~0); 8407#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8405#L12-2 assume true; 8403#L11-1 assume !!(main_~i~0 < main_~j~0); 8404#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 8401#L12-2 assume true; 8402#L11-1 [2018-10-27 06:11:13,317 INFO L795 eck$LassoCheckResult]: Loop: 8402#L11-1 assume !!(main_~i~0 < main_~j~0); 8407#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8405#L12-2 assume true; 8403#L11-1 assume !!(main_~i~0 < main_~j~0); 8404#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 8401#L12-2 assume true; 8402#L11-1 [2018-10-27 06:11:13,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash -950792191, now seen corresponding path program 29 times [2018-10-27 06:11:13,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 30 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:13,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:13,690 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:13,697 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:13,729 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-27 06:11:13,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:13,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 30 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:13,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-27 06:11:13,756 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 26 times [2018-10-27 06:11:13,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 06:11:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-27 06:11:13,785 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. cyclomatic complexity: 3 Second operand 32 states. [2018-10-27 06:11:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:13,839 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-10-27 06:11:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 06:11:13,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 103 transitions. [2018-10-27 06:11:13,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:13,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 99 states and 101 transitions. [2018-10-27 06:11:13,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:13,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:13,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2018-10-27 06:11:13,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:13,841 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-10-27 06:11:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2018-10-27 06:11:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-27 06:11:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 06:11:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-10-27 06:11:13,843 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-10-27 06:11:13,843 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-10-27 06:11:13,843 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-10-27 06:11:13,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2018-10-27 06:11:13,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:13,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:13,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:13,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 30, 1, 1, 1] [2018-10-27 06:11:13,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:13,845 INFO L793 eck$LassoCheckResult]: Stem: 8905#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8898#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8899#L12-2 assume true; 8900#L11-1 assume !!(main_~i~0 < main_~j~0); 8903#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8901#L12-2 assume true; 8902#L11-1 assume !!(main_~i~0 < main_~j~0); 8904#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8994#L12-2 assume true; 8993#L11-1 assume !!(main_~i~0 < main_~j~0); 8992#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8991#L12-2 assume true; 8990#L11-1 assume !!(main_~i~0 < main_~j~0); 8989#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8988#L12-2 assume true; 8987#L11-1 assume !!(main_~i~0 < main_~j~0); 8986#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8985#L12-2 assume true; 8984#L11-1 assume !!(main_~i~0 < main_~j~0); 8983#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8982#L12-2 assume true; 8981#L11-1 assume !!(main_~i~0 < main_~j~0); 8980#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8979#L12-2 assume true; 8978#L11-1 assume !!(main_~i~0 < main_~j~0); 8977#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8976#L12-2 assume true; 8975#L11-1 assume !!(main_~i~0 < main_~j~0); 8974#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8973#L12-2 assume true; 8972#L11-1 assume !!(main_~i~0 < main_~j~0); 8971#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8970#L12-2 assume true; 8969#L11-1 assume !!(main_~i~0 < main_~j~0); 8968#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8967#L12-2 assume true; 8966#L11-1 assume !!(main_~i~0 < main_~j~0); 8965#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8964#L12-2 assume true; 8963#L11-1 assume !!(main_~i~0 < main_~j~0); 8962#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8961#L12-2 assume true; 8960#L11-1 assume !!(main_~i~0 < main_~j~0); 8959#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8958#L12-2 assume true; 8957#L11-1 assume !!(main_~i~0 < main_~j~0); 8956#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8955#L12-2 assume true; 8954#L11-1 assume !!(main_~i~0 < main_~j~0); 8953#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8952#L12-2 assume true; 8951#L11-1 assume !!(main_~i~0 < main_~j~0); 8950#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8949#L12-2 assume true; 8948#L11-1 assume !!(main_~i~0 < main_~j~0); 8947#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8946#L12-2 assume true; 8945#L11-1 assume !!(main_~i~0 < main_~j~0); 8944#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8943#L12-2 assume true; 8942#L11-1 assume !!(main_~i~0 < main_~j~0); 8941#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8940#L12-2 assume true; 8939#L11-1 assume !!(main_~i~0 < main_~j~0); 8938#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8937#L12-2 assume true; 8936#L11-1 assume !!(main_~i~0 < main_~j~0); 8935#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8934#L12-2 assume true; 8933#L11-1 assume !!(main_~i~0 < main_~j~0); 8932#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8931#L12-2 assume true; 8930#L11-1 assume !!(main_~i~0 < main_~j~0); 8929#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8928#L12-2 assume true; 8927#L11-1 assume !!(main_~i~0 < main_~j~0); 8926#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8925#L12-2 assume true; 8924#L11-1 assume !!(main_~i~0 < main_~j~0); 8923#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8922#L12-2 assume true; 8921#L11-1 assume !!(main_~i~0 < main_~j~0); 8920#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8919#L12-2 assume true; 8918#L11-1 assume !!(main_~i~0 < main_~j~0); 8917#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8916#L12-2 assume true; 8915#L11-1 assume !!(main_~i~0 < main_~j~0); 8914#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8913#L12-2 assume true; 8911#L11-1 assume !!(main_~i~0 < main_~j~0); 8912#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8910#L12-2 assume true; 8908#L11-1 assume !!(main_~i~0 < main_~j~0); 8909#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 8906#L12-2 assume true; 8907#L11-1 [2018-10-27 06:11:13,845 INFO L795 eck$LassoCheckResult]: Loop: 8907#L11-1 assume !!(main_~i~0 < main_~j~0); 8912#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 8910#L12-2 assume true; 8908#L11-1 assume !!(main_~i~0 < main_~j~0); 8909#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 8906#L12-2 assume true; 8907#L11-1 [2018-10-27 06:11:13,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 257320062, now seen corresponding path program 30 times [2018-10-27 06:11:13,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:13,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:14,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:14,185 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:14,229 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-10-27 06:11:14,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:14,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:14,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:14,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-27 06:11:14,268 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:14,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 27 times [2018-10-27 06:11:14,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 06:11:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 06:11:14,296 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand 33 states. [2018-10-27 06:11:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:14,394 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-10-27 06:11:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 06:11:14,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 106 transitions. [2018-10-27 06:11:14,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:14,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 102 states and 104 transitions. [2018-10-27 06:11:14,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:14,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:14,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2018-10-27 06:11:14,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:14,396 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-10-27 06:11:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2018-10-27 06:11:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-27 06:11:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 06:11:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-10-27 06:11:14,398 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-27 06:11:14,398 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-27 06:11:14,398 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-10-27 06:11:14,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 102 transitions. [2018-10-27 06:11:14,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:14,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:14,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:14,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 31, 1, 1, 1] [2018-10-27 06:11:14,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:14,405 INFO L793 eck$LassoCheckResult]: Stem: 9428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9421#L12-2 assume true; 9422#L11-1 assume !!(main_~i~0 < main_~j~0); 9425#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9519#L12-2 assume true; 9426#L11-1 assume !!(main_~i~0 < main_~j~0); 9427#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9423#L12-2 assume true; 9424#L11-1 assume !!(main_~i~0 < main_~j~0); 9518#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9517#L12-2 assume true; 9516#L11-1 assume !!(main_~i~0 < main_~j~0); 9515#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9514#L12-2 assume true; 9513#L11-1 assume !!(main_~i~0 < main_~j~0); 9512#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9511#L12-2 assume true; 9510#L11-1 assume !!(main_~i~0 < main_~j~0); 9509#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9508#L12-2 assume true; 9507#L11-1 assume !!(main_~i~0 < main_~j~0); 9506#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9505#L12-2 assume true; 9504#L11-1 assume !!(main_~i~0 < main_~j~0); 9503#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9502#L12-2 assume true; 9501#L11-1 assume !!(main_~i~0 < main_~j~0); 9500#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9499#L12-2 assume true; 9498#L11-1 assume !!(main_~i~0 < main_~j~0); 9497#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9496#L12-2 assume true; 9495#L11-1 assume !!(main_~i~0 < main_~j~0); 9494#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9493#L12-2 assume true; 9492#L11-1 assume !!(main_~i~0 < main_~j~0); 9491#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9490#L12-2 assume true; 9489#L11-1 assume !!(main_~i~0 < main_~j~0); 9488#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9487#L12-2 assume true; 9486#L11-1 assume !!(main_~i~0 < main_~j~0); 9485#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9484#L12-2 assume true; 9483#L11-1 assume !!(main_~i~0 < main_~j~0); 9482#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9481#L12-2 assume true; 9480#L11-1 assume !!(main_~i~0 < main_~j~0); 9479#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9478#L12-2 assume true; 9477#L11-1 assume !!(main_~i~0 < main_~j~0); 9476#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9475#L12-2 assume true; 9474#L11-1 assume !!(main_~i~0 < main_~j~0); 9473#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9472#L12-2 assume true; 9471#L11-1 assume !!(main_~i~0 < main_~j~0); 9470#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9469#L12-2 assume true; 9468#L11-1 assume !!(main_~i~0 < main_~j~0); 9467#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9466#L12-2 assume true; 9465#L11-1 assume !!(main_~i~0 < main_~j~0); 9464#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9463#L12-2 assume true; 9462#L11-1 assume !!(main_~i~0 < main_~j~0); 9461#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9460#L12-2 assume true; 9459#L11-1 assume !!(main_~i~0 < main_~j~0); 9458#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9457#L12-2 assume true; 9456#L11-1 assume !!(main_~i~0 < main_~j~0); 9455#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9454#L12-2 assume true; 9453#L11-1 assume !!(main_~i~0 < main_~j~0); 9452#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9451#L12-2 assume true; 9450#L11-1 assume !!(main_~i~0 < main_~j~0); 9449#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9448#L12-2 assume true; 9447#L11-1 assume !!(main_~i~0 < main_~j~0); 9446#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9445#L12-2 assume true; 9444#L11-1 assume !!(main_~i~0 < main_~j~0); 9443#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9442#L12-2 assume true; 9441#L11-1 assume !!(main_~i~0 < main_~j~0); 9440#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9439#L12-2 assume true; 9438#L11-1 assume !!(main_~i~0 < main_~j~0); 9437#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9436#L12-2 assume true; 9434#L11-1 assume !!(main_~i~0 < main_~j~0); 9435#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9433#L12-2 assume true; 9431#L11-1 assume !!(main_~i~0 < main_~j~0); 9432#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 9429#L12-2 assume true; 9430#L11-1 [2018-10-27 06:11:14,405 INFO L795 eck$LassoCheckResult]: Loop: 9430#L11-1 assume !!(main_~i~0 < main_~j~0); 9435#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9433#L12-2 assume true; 9431#L11-1 assume !!(main_~i~0 < main_~j~0); 9432#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 9429#L12-2 assume true; 9430#L11-1 [2018-10-27 06:11:14,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -696491295, now seen corresponding path program 31 times [2018-10-27 06:11:14,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 32 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:14,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:14,789 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:14,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 32 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:14,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-27 06:11:14,848 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:14,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 28 times [2018-10-27 06:11:14,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-27 06:11:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 06:11:14,878 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. cyclomatic complexity: 3 Second operand 34 states. [2018-10-27 06:11:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:14,952 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-10-27 06:11:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-27 06:11:14,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 109 transitions. [2018-10-27 06:11:14,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:14,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 105 states and 107 transitions. [2018-10-27 06:11:14,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:14,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:14,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2018-10-27 06:11:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:14,955 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-10-27 06:11:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2018-10-27 06:11:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-27 06:11:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 06:11:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-27 06:11:14,957 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-27 06:11:14,957 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-27 06:11:14,957 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-10-27 06:11:14,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2018-10-27 06:11:14,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:14,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:14,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:14,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [34, 33, 32, 1, 1, 1] [2018-10-27 06:11:14,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:14,959 INFO L793 eck$LassoCheckResult]: Stem: 9966#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9959#L12-2 assume true; 9960#L11-1 assume !!(main_~i~0 < main_~j~0); 9963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10060#L12-2 assume true; 9964#L11-1 assume !!(main_~i~0 < main_~j~0); 9965#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9961#L12-2 assume true; 9962#L11-1 assume !!(main_~i~0 < main_~j~0); 10059#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10058#L12-2 assume true; 10057#L11-1 assume !!(main_~i~0 < main_~j~0); 10056#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10055#L12-2 assume true; 10054#L11-1 assume !!(main_~i~0 < main_~j~0); 10053#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10052#L12-2 assume true; 10051#L11-1 assume !!(main_~i~0 < main_~j~0); 10050#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10049#L12-2 assume true; 10048#L11-1 assume !!(main_~i~0 < main_~j~0); 10047#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10046#L12-2 assume true; 10045#L11-1 assume !!(main_~i~0 < main_~j~0); 10044#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10043#L12-2 assume true; 10042#L11-1 assume !!(main_~i~0 < main_~j~0); 10041#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10040#L12-2 assume true; 10039#L11-1 assume !!(main_~i~0 < main_~j~0); 10038#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10037#L12-2 assume true; 10036#L11-1 assume !!(main_~i~0 < main_~j~0); 10035#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10034#L12-2 assume true; 10033#L11-1 assume !!(main_~i~0 < main_~j~0); 10032#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10031#L12-2 assume true; 10030#L11-1 assume !!(main_~i~0 < main_~j~0); 10029#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10028#L12-2 assume true; 10027#L11-1 assume !!(main_~i~0 < main_~j~0); 10026#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10025#L12-2 assume true; 10024#L11-1 assume !!(main_~i~0 < main_~j~0); 10023#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10022#L12-2 assume true; 10021#L11-1 assume !!(main_~i~0 < main_~j~0); 10020#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10019#L12-2 assume true; 10018#L11-1 assume !!(main_~i~0 < main_~j~0); 10017#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10016#L12-2 assume true; 10015#L11-1 assume !!(main_~i~0 < main_~j~0); 10014#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10013#L12-2 assume true; 10012#L11-1 assume !!(main_~i~0 < main_~j~0); 10011#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10010#L12-2 assume true; 10009#L11-1 assume !!(main_~i~0 < main_~j~0); 10008#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10007#L12-2 assume true; 10006#L11-1 assume !!(main_~i~0 < main_~j~0); 10005#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10004#L12-2 assume true; 10003#L11-1 assume !!(main_~i~0 < main_~j~0); 10002#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10001#L12-2 assume true; 10000#L11-1 assume !!(main_~i~0 < main_~j~0); 9999#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9998#L12-2 assume true; 9997#L11-1 assume !!(main_~i~0 < main_~j~0); 9996#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9995#L12-2 assume true; 9994#L11-1 assume !!(main_~i~0 < main_~j~0); 9993#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9992#L12-2 assume true; 9991#L11-1 assume !!(main_~i~0 < main_~j~0); 9990#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9989#L12-2 assume true; 9988#L11-1 assume !!(main_~i~0 < main_~j~0); 9987#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9986#L12-2 assume true; 9985#L11-1 assume !!(main_~i~0 < main_~j~0); 9984#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9983#L12-2 assume true; 9982#L11-1 assume !!(main_~i~0 < main_~j~0); 9981#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9980#L12-2 assume true; 9979#L11-1 assume !!(main_~i~0 < main_~j~0); 9978#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9977#L12-2 assume true; 9976#L11-1 assume !!(main_~i~0 < main_~j~0); 9975#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9974#L12-2 assume true; 9972#L11-1 assume !!(main_~i~0 < main_~j~0); 9973#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9971#L12-2 assume true; 9969#L11-1 assume !!(main_~i~0 < main_~j~0); 9970#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 9967#L12-2 assume true; 9968#L11-1 [2018-10-27 06:11:14,959 INFO L795 eck$LassoCheckResult]: Loop: 9968#L11-1 assume !!(main_~i~0 < main_~j~0); 9973#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 9971#L12-2 assume true; 9969#L11-1 assume !!(main_~i~0 < main_~j~0); 9970#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 9967#L12-2 assume true; 9968#L11-1 [2018-10-27 06:11:14,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash -186997346, now seen corresponding path program 32 times [2018-10-27 06:11:14,959 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:14,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 33 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:15,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:15,405 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:15,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:15,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:15,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:15,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 33 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:15,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:15,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-27 06:11:15,476 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:15,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 29 times [2018-10-27 06:11:15,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:15,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 06:11:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 06:11:15,520 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. cyclomatic complexity: 3 Second operand 35 states. [2018-10-27 06:11:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:15,587 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-10-27 06:11:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 06:11:15,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 112 transitions. [2018-10-27 06:11:15,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:15,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 108 states and 110 transitions. [2018-10-27 06:11:15,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:15,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:15,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 110 transitions. [2018-10-27 06:11:15,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:15,590 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-10-27 06:11:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 110 transitions. [2018-10-27 06:11:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-27 06:11:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 06:11:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-10-27 06:11:15,592 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-10-27 06:11:15,592 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-10-27 06:11:15,592 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-10-27 06:11:15,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2018-10-27 06:11:15,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:15,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:15,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:15,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 33, 1, 1, 1] [2018-10-27 06:11:15,593 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:15,593 INFO L793 eck$LassoCheckResult]: Stem: 10520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 10513#L12-2 assume true; 10514#L11-1 assume !!(main_~i~0 < main_~j~0); 10517#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10617#L12-2 assume true; 10518#L11-1 assume !!(main_~i~0 < main_~j~0); 10519#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10515#L12-2 assume true; 10516#L11-1 assume !!(main_~i~0 < main_~j~0); 10616#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10615#L12-2 assume true; 10614#L11-1 assume !!(main_~i~0 < main_~j~0); 10613#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10612#L12-2 assume true; 10611#L11-1 assume !!(main_~i~0 < main_~j~0); 10610#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10609#L12-2 assume true; 10608#L11-1 assume !!(main_~i~0 < main_~j~0); 10607#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10606#L12-2 assume true; 10605#L11-1 assume !!(main_~i~0 < main_~j~0); 10604#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10603#L12-2 assume true; 10602#L11-1 assume !!(main_~i~0 < main_~j~0); 10601#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10600#L12-2 assume true; 10599#L11-1 assume !!(main_~i~0 < main_~j~0); 10598#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10597#L12-2 assume true; 10596#L11-1 assume !!(main_~i~0 < main_~j~0); 10595#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10594#L12-2 assume true; 10593#L11-1 assume !!(main_~i~0 < main_~j~0); 10592#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10591#L12-2 assume true; 10590#L11-1 assume !!(main_~i~0 < main_~j~0); 10589#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10588#L12-2 assume true; 10587#L11-1 assume !!(main_~i~0 < main_~j~0); 10586#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10585#L12-2 assume true; 10584#L11-1 assume !!(main_~i~0 < main_~j~0); 10583#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10582#L12-2 assume true; 10581#L11-1 assume !!(main_~i~0 < main_~j~0); 10580#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10579#L12-2 assume true; 10578#L11-1 assume !!(main_~i~0 < main_~j~0); 10577#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10576#L12-2 assume true; 10575#L11-1 assume !!(main_~i~0 < main_~j~0); 10574#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10573#L12-2 assume true; 10572#L11-1 assume !!(main_~i~0 < main_~j~0); 10571#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10570#L12-2 assume true; 10569#L11-1 assume !!(main_~i~0 < main_~j~0); 10568#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10567#L12-2 assume true; 10566#L11-1 assume !!(main_~i~0 < main_~j~0); 10565#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10564#L12-2 assume true; 10563#L11-1 assume !!(main_~i~0 < main_~j~0); 10562#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10561#L12-2 assume true; 10560#L11-1 assume !!(main_~i~0 < main_~j~0); 10559#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10558#L12-2 assume true; 10557#L11-1 assume !!(main_~i~0 < main_~j~0); 10556#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10555#L12-2 assume true; 10554#L11-1 assume !!(main_~i~0 < main_~j~0); 10553#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10552#L12-2 assume true; 10551#L11-1 assume !!(main_~i~0 < main_~j~0); 10550#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10549#L12-2 assume true; 10548#L11-1 assume !!(main_~i~0 < main_~j~0); 10547#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10546#L12-2 assume true; 10545#L11-1 assume !!(main_~i~0 < main_~j~0); 10544#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10543#L12-2 assume true; 10542#L11-1 assume !!(main_~i~0 < main_~j~0); 10541#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10540#L12-2 assume true; 10539#L11-1 assume !!(main_~i~0 < main_~j~0); 10538#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10537#L12-2 assume true; 10536#L11-1 assume !!(main_~i~0 < main_~j~0); 10535#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10534#L12-2 assume true; 10533#L11-1 assume !!(main_~i~0 < main_~j~0); 10532#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10531#L12-2 assume true; 10530#L11-1 assume !!(main_~i~0 < main_~j~0); 10529#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10528#L12-2 assume true; 10526#L11-1 assume !!(main_~i~0 < main_~j~0); 10527#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10525#L12-2 assume true; 10523#L11-1 assume !!(main_~i~0 < main_~j~0); 10524#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 10521#L12-2 assume true; 10522#L11-1 [2018-10-27 06:11:15,593 INFO L795 eck$LassoCheckResult]: Loop: 10522#L11-1 assume !!(main_~i~0 < main_~j~0); 10527#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 10525#L12-2 assume true; 10523#L11-1 assume !!(main_~i~0 < main_~j~0); 10524#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 10521#L12-2 assume true; 10522#L11-1 [2018-10-27 06:11:15,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash -267186751, now seen corresponding path program 33 times [2018-10-27 06:11:15,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:15,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 34 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:16,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:16,018 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:16,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:16,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-27 06:11:16,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:16,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 34 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-27 06:11:16,177 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:16,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 30 times [2018-10-27 06:11:16,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 06:11:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 06:11:16,211 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. cyclomatic complexity: 3 Second operand 36 states. [2018-10-27 06:11:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:16,331 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-10-27 06:11:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 06:11:16,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 115 transitions. [2018-10-27 06:11:16,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:16,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 111 states and 113 transitions. [2018-10-27 06:11:16,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:16,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:16,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 113 transitions. [2018-10-27 06:11:16,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:16,335 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-10-27 06:11:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 113 transitions. [2018-10-27 06:11:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-27 06:11:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-27 06:11:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-10-27 06:11:16,337 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-10-27 06:11:16,337 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-10-27 06:11:16,337 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-10-27 06:11:16,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 111 transitions. [2018-10-27 06:11:16,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:16,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:16,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:16,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [36, 35, 34, 1, 1, 1] [2018-10-27 06:11:16,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:16,339 INFO L793 eck$LassoCheckResult]: Stem: 11089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11082#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11083#L12-2 assume true; 11084#L11-1 assume !!(main_~i~0 < main_~j~0); 11085#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11088#L12-2 assume true; 11086#L11-1 assume !!(main_~i~0 < main_~j~0); 11087#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11190#L12-2 assume true; 11189#L11-1 assume !!(main_~i~0 < main_~j~0); 11188#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11187#L12-2 assume true; 11186#L11-1 assume !!(main_~i~0 < main_~j~0); 11185#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11184#L12-2 assume true; 11183#L11-1 assume !!(main_~i~0 < main_~j~0); 11182#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11181#L12-2 assume true; 11180#L11-1 assume !!(main_~i~0 < main_~j~0); 11179#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11178#L12-2 assume true; 11177#L11-1 assume !!(main_~i~0 < main_~j~0); 11176#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11175#L12-2 assume true; 11174#L11-1 assume !!(main_~i~0 < main_~j~0); 11173#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11172#L12-2 assume true; 11171#L11-1 assume !!(main_~i~0 < main_~j~0); 11170#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11169#L12-2 assume true; 11168#L11-1 assume !!(main_~i~0 < main_~j~0); 11167#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11166#L12-2 assume true; 11165#L11-1 assume !!(main_~i~0 < main_~j~0); 11164#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11163#L12-2 assume true; 11162#L11-1 assume !!(main_~i~0 < main_~j~0); 11161#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11160#L12-2 assume true; 11159#L11-1 assume !!(main_~i~0 < main_~j~0); 11158#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11157#L12-2 assume true; 11156#L11-1 assume !!(main_~i~0 < main_~j~0); 11155#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11154#L12-2 assume true; 11153#L11-1 assume !!(main_~i~0 < main_~j~0); 11152#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11151#L12-2 assume true; 11150#L11-1 assume !!(main_~i~0 < main_~j~0); 11149#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11148#L12-2 assume true; 11147#L11-1 assume !!(main_~i~0 < main_~j~0); 11146#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11145#L12-2 assume true; 11144#L11-1 assume !!(main_~i~0 < main_~j~0); 11143#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11142#L12-2 assume true; 11141#L11-1 assume !!(main_~i~0 < main_~j~0); 11140#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11139#L12-2 assume true; 11138#L11-1 assume !!(main_~i~0 < main_~j~0); 11137#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11136#L12-2 assume true; 11135#L11-1 assume !!(main_~i~0 < main_~j~0); 11134#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11133#L12-2 assume true; 11132#L11-1 assume !!(main_~i~0 < main_~j~0); 11131#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11130#L12-2 assume true; 11129#L11-1 assume !!(main_~i~0 < main_~j~0); 11128#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11127#L12-2 assume true; 11126#L11-1 assume !!(main_~i~0 < main_~j~0); 11125#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11124#L12-2 assume true; 11123#L11-1 assume !!(main_~i~0 < main_~j~0); 11122#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11121#L12-2 assume true; 11120#L11-1 assume !!(main_~i~0 < main_~j~0); 11119#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11118#L12-2 assume true; 11117#L11-1 assume !!(main_~i~0 < main_~j~0); 11116#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11115#L12-2 assume true; 11114#L11-1 assume !!(main_~i~0 < main_~j~0); 11113#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11112#L12-2 assume true; 11111#L11-1 assume !!(main_~i~0 < main_~j~0); 11110#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11109#L12-2 assume true; 11108#L11-1 assume !!(main_~i~0 < main_~j~0); 11107#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11106#L12-2 assume true; 11105#L11-1 assume !!(main_~i~0 < main_~j~0); 11104#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11103#L12-2 assume true; 11102#L11-1 assume !!(main_~i~0 < main_~j~0); 11101#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11100#L12-2 assume true; 11099#L11-1 assume !!(main_~i~0 < main_~j~0); 11098#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11097#L12-2 assume true; 11095#L11-1 assume !!(main_~i~0 < main_~j~0); 11096#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11094#L12-2 assume true; 11092#L11-1 assume !!(main_~i~0 < main_~j~0); 11093#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 11090#L12-2 assume true; 11091#L11-1 [2018-10-27 06:11:16,339 INFO L795 eck$LassoCheckResult]: Loop: 11091#L11-1 assume !!(main_~i~0 < main_~j~0); 11096#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11094#L12-2 assume true; 11092#L11-1 assume !!(main_~i~0 < main_~j~0); 11093#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 11090#L12-2 assume true; 11091#L11-1 [2018-10-27 06:11:16,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1187934530, now seen corresponding path program 34 times [2018-10-27 06:11:16,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:16,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:16,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:16,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 35 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:16,794 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:16,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:16,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:16,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 35 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:16,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:16,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-27 06:11:16,860 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:16,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 31 times [2018-10-27 06:11:16,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 06:11:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 06:11:16,961 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. cyclomatic complexity: 3 Second operand 37 states. [2018-10-27 06:11:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:17,032 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-10-27 06:11:17,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 06:11:17,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 118 transitions. [2018-10-27 06:11:17,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:17,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 114 states and 116 transitions. [2018-10-27 06:11:17,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:17,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:17,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 116 transitions. [2018-10-27 06:11:17,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:17,035 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-10-27 06:11:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 116 transitions. [2018-10-27 06:11:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-27 06:11:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 06:11:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-27 06:11:17,036 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-27 06:11:17,036 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-27 06:11:17,036 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-10-27 06:11:17,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 114 transitions. [2018-10-27 06:11:17,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:17,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:17,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:17,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 35, 1, 1, 1] [2018-10-27 06:11:17,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:17,038 INFO L793 eck$LassoCheckResult]: Stem: 11675#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11669#L12-2 assume true; 11670#L11-1 assume !!(main_~i~0 < main_~j~0); 11673#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11671#L12-2 assume true; 11672#L11-1 assume !!(main_~i~0 < main_~j~0); 11674#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11779#L12-2 assume true; 11778#L11-1 assume !!(main_~i~0 < main_~j~0); 11777#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11776#L12-2 assume true; 11775#L11-1 assume !!(main_~i~0 < main_~j~0); 11774#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11773#L12-2 assume true; 11772#L11-1 assume !!(main_~i~0 < main_~j~0); 11771#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11770#L12-2 assume true; 11769#L11-1 assume !!(main_~i~0 < main_~j~0); 11768#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11767#L12-2 assume true; 11766#L11-1 assume !!(main_~i~0 < main_~j~0); 11765#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11764#L12-2 assume true; 11763#L11-1 assume !!(main_~i~0 < main_~j~0); 11762#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11761#L12-2 assume true; 11760#L11-1 assume !!(main_~i~0 < main_~j~0); 11759#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11758#L12-2 assume true; 11757#L11-1 assume !!(main_~i~0 < main_~j~0); 11756#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11755#L12-2 assume true; 11754#L11-1 assume !!(main_~i~0 < main_~j~0); 11753#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11752#L12-2 assume true; 11751#L11-1 assume !!(main_~i~0 < main_~j~0); 11750#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11749#L12-2 assume true; 11748#L11-1 assume !!(main_~i~0 < main_~j~0); 11747#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11746#L12-2 assume true; 11745#L11-1 assume !!(main_~i~0 < main_~j~0); 11744#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11743#L12-2 assume true; 11742#L11-1 assume !!(main_~i~0 < main_~j~0); 11741#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11740#L12-2 assume true; 11739#L11-1 assume !!(main_~i~0 < main_~j~0); 11738#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11737#L12-2 assume true; 11736#L11-1 assume !!(main_~i~0 < main_~j~0); 11735#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11734#L12-2 assume true; 11733#L11-1 assume !!(main_~i~0 < main_~j~0); 11732#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11731#L12-2 assume true; 11730#L11-1 assume !!(main_~i~0 < main_~j~0); 11729#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11728#L12-2 assume true; 11727#L11-1 assume !!(main_~i~0 < main_~j~0); 11726#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11725#L12-2 assume true; 11724#L11-1 assume !!(main_~i~0 < main_~j~0); 11723#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11722#L12-2 assume true; 11721#L11-1 assume !!(main_~i~0 < main_~j~0); 11720#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11719#L12-2 assume true; 11718#L11-1 assume !!(main_~i~0 < main_~j~0); 11717#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11716#L12-2 assume true; 11715#L11-1 assume !!(main_~i~0 < main_~j~0); 11714#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11713#L12-2 assume true; 11712#L11-1 assume !!(main_~i~0 < main_~j~0); 11711#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11710#L12-2 assume true; 11709#L11-1 assume !!(main_~i~0 < main_~j~0); 11708#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11707#L12-2 assume true; 11706#L11-1 assume !!(main_~i~0 < main_~j~0); 11705#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11704#L12-2 assume true; 11703#L11-1 assume !!(main_~i~0 < main_~j~0); 11702#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11701#L12-2 assume true; 11700#L11-1 assume !!(main_~i~0 < main_~j~0); 11699#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11698#L12-2 assume true; 11697#L11-1 assume !!(main_~i~0 < main_~j~0); 11696#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11695#L12-2 assume true; 11694#L11-1 assume !!(main_~i~0 < main_~j~0); 11693#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11692#L12-2 assume true; 11691#L11-1 assume !!(main_~i~0 < main_~j~0); 11690#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11689#L12-2 assume true; 11688#L11-1 assume !!(main_~i~0 < main_~j~0); 11687#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11686#L12-2 assume true; 11685#L11-1 assume !!(main_~i~0 < main_~j~0); 11684#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11683#L12-2 assume true; 11681#L11-1 assume !!(main_~i~0 < main_~j~0); 11682#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11680#L12-2 assume true; 11678#L11-1 assume !!(main_~i~0 < main_~j~0); 11679#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 11676#L12-2 assume true; 11677#L11-1 [2018-10-27 06:11:17,038 INFO L795 eck$LassoCheckResult]: Loop: 11677#L11-1 assume !!(main_~i~0 < main_~j~0); 11682#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 11680#L12-2 assume true; 11678#L11-1 assume !!(main_~i~0 < main_~j~0); 11679#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 11676#L12-2 assume true; 11677#L11-1 [2018-10-27 06:11:17,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash 771100833, now seen corresponding path program 35 times [2018-10-27 06:11:17,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:17,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 36 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:17,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:17,588 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:17,639 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-27 06:11:17,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:17,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 36 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:17,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:17,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-27 06:11:17,673 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:17,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 32 times [2018-10-27 06:11:17,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:17,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 06:11:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 06:11:17,703 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. cyclomatic complexity: 3 Second operand 38 states. [2018-10-27 06:11:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:17,777 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-10-27 06:11:17,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 06:11:17,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 121 transitions. [2018-10-27 06:11:17,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:17,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 119 transitions. [2018-10-27 06:11:17,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:17,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:17,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 119 transitions. [2018-10-27 06:11:17,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:17,780 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-10-27 06:11:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 119 transitions. [2018-10-27 06:11:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-27 06:11:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-27 06:11:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-27 06:11:17,782 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-27 06:11:17,782 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-27 06:11:17,782 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-10-27 06:11:17,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 117 transitions. [2018-10-27 06:11:17,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:17,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:17,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:17,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 36, 1, 1, 1] [2018-10-27 06:11:17,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:17,784 INFO L793 eck$LassoCheckResult]: Stem: 12278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12271#L12-2 assume true; 12272#L11-1 assume !!(main_~i~0 < main_~j~0); 12275#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12384#L12-2 assume true; 12276#L11-1 assume !!(main_~i~0 < main_~j~0); 12277#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12273#L12-2 assume true; 12274#L11-1 assume !!(main_~i~0 < main_~j~0); 12383#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12382#L12-2 assume true; 12381#L11-1 assume !!(main_~i~0 < main_~j~0); 12380#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12379#L12-2 assume true; 12378#L11-1 assume !!(main_~i~0 < main_~j~0); 12377#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12376#L12-2 assume true; 12375#L11-1 assume !!(main_~i~0 < main_~j~0); 12374#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12373#L12-2 assume true; 12372#L11-1 assume !!(main_~i~0 < main_~j~0); 12371#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12370#L12-2 assume true; 12369#L11-1 assume !!(main_~i~0 < main_~j~0); 12368#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12367#L12-2 assume true; 12366#L11-1 assume !!(main_~i~0 < main_~j~0); 12365#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12364#L12-2 assume true; 12363#L11-1 assume !!(main_~i~0 < main_~j~0); 12362#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12361#L12-2 assume true; 12360#L11-1 assume !!(main_~i~0 < main_~j~0); 12359#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12358#L12-2 assume true; 12357#L11-1 assume !!(main_~i~0 < main_~j~0); 12356#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12355#L12-2 assume true; 12354#L11-1 assume !!(main_~i~0 < main_~j~0); 12353#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12352#L12-2 assume true; 12351#L11-1 assume !!(main_~i~0 < main_~j~0); 12350#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12349#L12-2 assume true; 12348#L11-1 assume !!(main_~i~0 < main_~j~0); 12347#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12346#L12-2 assume true; 12345#L11-1 assume !!(main_~i~0 < main_~j~0); 12344#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12343#L12-2 assume true; 12342#L11-1 assume !!(main_~i~0 < main_~j~0); 12341#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12340#L12-2 assume true; 12339#L11-1 assume !!(main_~i~0 < main_~j~0); 12338#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12337#L12-2 assume true; 12336#L11-1 assume !!(main_~i~0 < main_~j~0); 12335#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12334#L12-2 assume true; 12333#L11-1 assume !!(main_~i~0 < main_~j~0); 12332#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12331#L12-2 assume true; 12330#L11-1 assume !!(main_~i~0 < main_~j~0); 12329#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12328#L12-2 assume true; 12327#L11-1 assume !!(main_~i~0 < main_~j~0); 12326#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12325#L12-2 assume true; 12324#L11-1 assume !!(main_~i~0 < main_~j~0); 12323#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12322#L12-2 assume true; 12321#L11-1 assume !!(main_~i~0 < main_~j~0); 12320#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12319#L12-2 assume true; 12318#L11-1 assume !!(main_~i~0 < main_~j~0); 12317#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12316#L12-2 assume true; 12315#L11-1 assume !!(main_~i~0 < main_~j~0); 12314#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12313#L12-2 assume true; 12312#L11-1 assume !!(main_~i~0 < main_~j~0); 12311#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12310#L12-2 assume true; 12309#L11-1 assume !!(main_~i~0 < main_~j~0); 12308#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12307#L12-2 assume true; 12306#L11-1 assume !!(main_~i~0 < main_~j~0); 12305#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12304#L12-2 assume true; 12303#L11-1 assume !!(main_~i~0 < main_~j~0); 12302#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12301#L12-2 assume true; 12300#L11-1 assume !!(main_~i~0 < main_~j~0); 12299#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12298#L12-2 assume true; 12297#L11-1 assume !!(main_~i~0 < main_~j~0); 12296#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12295#L12-2 assume true; 12294#L11-1 assume !!(main_~i~0 < main_~j~0); 12293#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12292#L12-2 assume true; 12291#L11-1 assume !!(main_~i~0 < main_~j~0); 12290#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12289#L12-2 assume true; 12288#L11-1 assume !!(main_~i~0 < main_~j~0); 12287#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12286#L12-2 assume true; 12284#L11-1 assume !!(main_~i~0 < main_~j~0); 12285#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12283#L12-2 assume true; 12281#L11-1 assume !!(main_~i~0 < main_~j~0); 12282#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 12279#L12-2 assume true; 12280#L11-1 [2018-10-27 06:11:17,784 INFO L795 eck$LassoCheckResult]: Loop: 12280#L11-1 assume !!(main_~i~0 < main_~j~0); 12285#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12283#L12-2 assume true; 12281#L11-1 assume !!(main_~i~0 < main_~j~0); 12282#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 12279#L12-2 assume true; 12280#L11-1 [2018-10-27 06:11:17,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1916985378, now seen corresponding path program 36 times [2018-10-27 06:11:17,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:17,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 37 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:18,275 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:18,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-10-27 06:11:18,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:18,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 37 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-27 06:11:18,375 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:18,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:18,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 33 times [2018-10-27 06:11:18,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:18,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:18,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:18,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-27 06:11:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 06:11:18,413 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. cyclomatic complexity: 3 Second operand 39 states. [2018-10-27 06:11:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:18,477 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-10-27 06:11:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 06:11:18,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 124 transitions. [2018-10-27 06:11:18,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:18,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 120 states and 122 transitions. [2018-10-27 06:11:18,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:18,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:18,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 122 transitions. [2018-10-27 06:11:18,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:18,481 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-10-27 06:11:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 122 transitions. [2018-10-27 06:11:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-27 06:11:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 06:11:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-27 06:11:18,482 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-27 06:11:18,482 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-27 06:11:18,482 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2018-10-27 06:11:18,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 120 transitions. [2018-10-27 06:11:18,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:18,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:18,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:18,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [39, 38, 37, 1, 1, 1] [2018-10-27 06:11:18,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:18,484 INFO L793 eck$LassoCheckResult]: Stem: 12896#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12888#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12889#L12-2 assume true; 12890#L11-1 assume !!(main_~i~0 < main_~j~0); 12893#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13005#L12-2 assume true; 12894#L11-1 assume !!(main_~i~0 < main_~j~0); 12895#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12891#L12-2 assume true; 12892#L11-1 assume !!(main_~i~0 < main_~j~0); 13004#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13003#L12-2 assume true; 13002#L11-1 assume !!(main_~i~0 < main_~j~0); 13001#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13000#L12-2 assume true; 12999#L11-1 assume !!(main_~i~0 < main_~j~0); 12998#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12997#L12-2 assume true; 12996#L11-1 assume !!(main_~i~0 < main_~j~0); 12995#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12994#L12-2 assume true; 12993#L11-1 assume !!(main_~i~0 < main_~j~0); 12992#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12991#L12-2 assume true; 12990#L11-1 assume !!(main_~i~0 < main_~j~0); 12989#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12988#L12-2 assume true; 12987#L11-1 assume !!(main_~i~0 < main_~j~0); 12986#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12985#L12-2 assume true; 12984#L11-1 assume !!(main_~i~0 < main_~j~0); 12983#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12982#L12-2 assume true; 12981#L11-1 assume !!(main_~i~0 < main_~j~0); 12980#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12979#L12-2 assume true; 12978#L11-1 assume !!(main_~i~0 < main_~j~0); 12977#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12976#L12-2 assume true; 12975#L11-1 assume !!(main_~i~0 < main_~j~0); 12974#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12973#L12-2 assume true; 12972#L11-1 assume !!(main_~i~0 < main_~j~0); 12971#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12970#L12-2 assume true; 12969#L11-1 assume !!(main_~i~0 < main_~j~0); 12968#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12967#L12-2 assume true; 12966#L11-1 assume !!(main_~i~0 < main_~j~0); 12965#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12964#L12-2 assume true; 12963#L11-1 assume !!(main_~i~0 < main_~j~0); 12962#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12961#L12-2 assume true; 12960#L11-1 assume !!(main_~i~0 < main_~j~0); 12959#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12958#L12-2 assume true; 12957#L11-1 assume !!(main_~i~0 < main_~j~0); 12956#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12955#L12-2 assume true; 12954#L11-1 assume !!(main_~i~0 < main_~j~0); 12953#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12952#L12-2 assume true; 12951#L11-1 assume !!(main_~i~0 < main_~j~0); 12950#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12949#L12-2 assume true; 12948#L11-1 assume !!(main_~i~0 < main_~j~0); 12947#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12946#L12-2 assume true; 12945#L11-1 assume !!(main_~i~0 < main_~j~0); 12944#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12943#L12-2 assume true; 12942#L11-1 assume !!(main_~i~0 < main_~j~0); 12941#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12940#L12-2 assume true; 12939#L11-1 assume !!(main_~i~0 < main_~j~0); 12938#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12937#L12-2 assume true; 12936#L11-1 assume !!(main_~i~0 < main_~j~0); 12935#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12934#L12-2 assume true; 12933#L11-1 assume !!(main_~i~0 < main_~j~0); 12932#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12931#L12-2 assume true; 12930#L11-1 assume !!(main_~i~0 < main_~j~0); 12929#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12928#L12-2 assume true; 12927#L11-1 assume !!(main_~i~0 < main_~j~0); 12926#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12925#L12-2 assume true; 12924#L11-1 assume !!(main_~i~0 < main_~j~0); 12923#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12922#L12-2 assume true; 12921#L11-1 assume !!(main_~i~0 < main_~j~0); 12920#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12919#L12-2 assume true; 12918#L11-1 assume !!(main_~i~0 < main_~j~0); 12917#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12916#L12-2 assume true; 12915#L11-1 assume !!(main_~i~0 < main_~j~0); 12914#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12913#L12-2 assume true; 12912#L11-1 assume !!(main_~i~0 < main_~j~0); 12911#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12910#L12-2 assume true; 12909#L11-1 assume !!(main_~i~0 < main_~j~0); 12908#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12907#L12-2 assume true; 12906#L11-1 assume !!(main_~i~0 < main_~j~0); 12905#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12904#L12-2 assume true; 12902#L11-1 assume !!(main_~i~0 < main_~j~0); 12903#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12901#L12-2 assume true; 12899#L11-1 assume !!(main_~i~0 < main_~j~0); 12900#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 12897#L12-2 assume true; 12898#L11-1 [2018-10-27 06:11:18,484 INFO L795 eck$LassoCheckResult]: Loop: 12898#L11-1 assume !!(main_~i~0 < main_~j~0); 12903#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 12901#L12-2 assume true; 12899#L11-1 assume !!(main_~i~0 < main_~j~0); 12900#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 12897#L12-2 assume true; 12898#L11-1 [2018-10-27 06:11:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1266903937, now seen corresponding path program 37 times [2018-10-27 06:11:18,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 38 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:19,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:19,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:19,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:19,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 38 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:19,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:19,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-27 06:11:19,123 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 34 times [2018-10-27 06:11:19,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-27 06:11:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 06:11:19,152 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. cyclomatic complexity: 3 Second operand 40 states. [2018-10-27 06:11:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:19,231 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-10-27 06:11:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 06:11:19,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 127 transitions. [2018-10-27 06:11:19,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:19,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 123 states and 125 transitions. [2018-10-27 06:11:19,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:19,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:19,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 125 transitions. [2018-10-27 06:11:19,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:19,235 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-10-27 06:11:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 125 transitions. [2018-10-27 06:11:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-27 06:11:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-27 06:11:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-27 06:11:19,236 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-27 06:11:19,237 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-27 06:11:19,237 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2018-10-27 06:11:19,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 123 transitions. [2018-10-27 06:11:19,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:19,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:19,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:19,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [40, 39, 38, 1, 1, 1] [2018-10-27 06:11:19,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:19,238 INFO L793 eck$LassoCheckResult]: Stem: 13529#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 13523#L12-2 assume true; 13524#L11-1 assume !!(main_~i~0 < main_~j~0); 13527#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13525#L12-2 assume true; 13526#L11-1 assume !!(main_~i~0 < main_~j~0); 13528#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13642#L12-2 assume true; 13641#L11-1 assume !!(main_~i~0 < main_~j~0); 13640#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13639#L12-2 assume true; 13638#L11-1 assume !!(main_~i~0 < main_~j~0); 13637#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13636#L12-2 assume true; 13635#L11-1 assume !!(main_~i~0 < main_~j~0); 13634#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13633#L12-2 assume true; 13632#L11-1 assume !!(main_~i~0 < main_~j~0); 13631#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13630#L12-2 assume true; 13629#L11-1 assume !!(main_~i~0 < main_~j~0); 13628#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13627#L12-2 assume true; 13626#L11-1 assume !!(main_~i~0 < main_~j~0); 13625#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13624#L12-2 assume true; 13623#L11-1 assume !!(main_~i~0 < main_~j~0); 13622#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13621#L12-2 assume true; 13620#L11-1 assume !!(main_~i~0 < main_~j~0); 13619#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13618#L12-2 assume true; 13617#L11-1 assume !!(main_~i~0 < main_~j~0); 13616#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13615#L12-2 assume true; 13614#L11-1 assume !!(main_~i~0 < main_~j~0); 13613#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13612#L12-2 assume true; 13611#L11-1 assume !!(main_~i~0 < main_~j~0); 13610#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13609#L12-2 assume true; 13608#L11-1 assume !!(main_~i~0 < main_~j~0); 13607#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13606#L12-2 assume true; 13605#L11-1 assume !!(main_~i~0 < main_~j~0); 13604#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13603#L12-2 assume true; 13602#L11-1 assume !!(main_~i~0 < main_~j~0); 13601#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13600#L12-2 assume true; 13599#L11-1 assume !!(main_~i~0 < main_~j~0); 13598#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13597#L12-2 assume true; 13596#L11-1 assume !!(main_~i~0 < main_~j~0); 13595#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13594#L12-2 assume true; 13593#L11-1 assume !!(main_~i~0 < main_~j~0); 13592#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13591#L12-2 assume true; 13590#L11-1 assume !!(main_~i~0 < main_~j~0); 13589#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13588#L12-2 assume true; 13587#L11-1 assume !!(main_~i~0 < main_~j~0); 13586#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13585#L12-2 assume true; 13584#L11-1 assume !!(main_~i~0 < main_~j~0); 13583#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13582#L12-2 assume true; 13581#L11-1 assume !!(main_~i~0 < main_~j~0); 13580#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13579#L12-2 assume true; 13578#L11-1 assume !!(main_~i~0 < main_~j~0); 13577#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13576#L12-2 assume true; 13575#L11-1 assume !!(main_~i~0 < main_~j~0); 13574#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13573#L12-2 assume true; 13572#L11-1 assume !!(main_~i~0 < main_~j~0); 13571#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13570#L12-2 assume true; 13569#L11-1 assume !!(main_~i~0 < main_~j~0); 13568#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13567#L12-2 assume true; 13566#L11-1 assume !!(main_~i~0 < main_~j~0); 13565#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13564#L12-2 assume true; 13563#L11-1 assume !!(main_~i~0 < main_~j~0); 13562#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13561#L12-2 assume true; 13560#L11-1 assume !!(main_~i~0 < main_~j~0); 13559#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13558#L12-2 assume true; 13557#L11-1 assume !!(main_~i~0 < main_~j~0); 13556#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13555#L12-2 assume true; 13554#L11-1 assume !!(main_~i~0 < main_~j~0); 13553#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13552#L12-2 assume true; 13551#L11-1 assume !!(main_~i~0 < main_~j~0); 13550#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13549#L12-2 assume true; 13548#L11-1 assume !!(main_~i~0 < main_~j~0); 13547#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13546#L12-2 assume true; 13545#L11-1 assume !!(main_~i~0 < main_~j~0); 13544#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13543#L12-2 assume true; 13542#L11-1 assume !!(main_~i~0 < main_~j~0); 13541#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13540#L12-2 assume true; 13539#L11-1 assume !!(main_~i~0 < main_~j~0); 13538#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13537#L12-2 assume true; 13535#L11-1 assume !!(main_~i~0 < main_~j~0); 13536#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13534#L12-2 assume true; 13532#L11-1 assume !!(main_~i~0 < main_~j~0); 13533#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 13530#L12-2 assume true; 13531#L11-1 [2018-10-27 06:11:19,238 INFO L795 eck$LassoCheckResult]: Loop: 13531#L11-1 assume !!(main_~i~0 < main_~j~0); 13536#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 13534#L12-2 assume true; 13532#L11-1 assume !!(main_~i~0 < main_~j~0); 13533#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 13530#L12-2 assume true; 13531#L11-1 [2018-10-27 06:11:19,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:19,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1839245058, now seen corresponding path program 38 times [2018-10-27 06:11:19,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:19,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:19,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 39 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:20,804 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:20,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:20,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:20,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:20,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 39 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:20,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:20,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-27 06:11:20,878 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:20,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 35 times [2018-10-27 06:11:20,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:20,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:20,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-27 06:11:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-27 06:11:20,908 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. cyclomatic complexity: 3 Second operand 41 states. [2018-10-27 06:11:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:20,986 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-10-27 06:11:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 06:11:20,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 130 transitions. [2018-10-27 06:11:20,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:20,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 126 states and 128 transitions. [2018-10-27 06:11:20,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:20,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:20,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 128 transitions. [2018-10-27 06:11:20,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:20,989 INFO L705 BuchiCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-27 06:11:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 128 transitions. [2018-10-27 06:11:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-27 06:11:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-27 06:11:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-10-27 06:11:20,991 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-10-27 06:11:20,991 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-10-27 06:11:20,991 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2018-10-27 06:11:20,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 126 transitions. [2018-10-27 06:11:20,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:20,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:20,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:20,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [41, 40, 39, 1, 1, 1] [2018-10-27 06:11:20,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:20,993 INFO L793 eck$LassoCheckResult]: Stem: 14179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14173#L12-2 assume true; 14174#L11-1 assume !!(main_~i~0 < main_~j~0); 14175#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14178#L12-2 assume true; 14176#L11-1 assume !!(main_~i~0 < main_~j~0); 14177#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14295#L12-2 assume true; 14294#L11-1 assume !!(main_~i~0 < main_~j~0); 14293#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14292#L12-2 assume true; 14291#L11-1 assume !!(main_~i~0 < main_~j~0); 14290#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14289#L12-2 assume true; 14288#L11-1 assume !!(main_~i~0 < main_~j~0); 14287#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14286#L12-2 assume true; 14285#L11-1 assume !!(main_~i~0 < main_~j~0); 14284#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14283#L12-2 assume true; 14282#L11-1 assume !!(main_~i~0 < main_~j~0); 14281#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14280#L12-2 assume true; 14279#L11-1 assume !!(main_~i~0 < main_~j~0); 14278#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14277#L12-2 assume true; 14276#L11-1 assume !!(main_~i~0 < main_~j~0); 14275#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14274#L12-2 assume true; 14273#L11-1 assume !!(main_~i~0 < main_~j~0); 14272#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14271#L12-2 assume true; 14270#L11-1 assume !!(main_~i~0 < main_~j~0); 14269#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14268#L12-2 assume true; 14267#L11-1 assume !!(main_~i~0 < main_~j~0); 14266#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14265#L12-2 assume true; 14264#L11-1 assume !!(main_~i~0 < main_~j~0); 14263#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14262#L12-2 assume true; 14261#L11-1 assume !!(main_~i~0 < main_~j~0); 14260#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14259#L12-2 assume true; 14258#L11-1 assume !!(main_~i~0 < main_~j~0); 14257#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14256#L12-2 assume true; 14255#L11-1 assume !!(main_~i~0 < main_~j~0); 14254#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14253#L12-2 assume true; 14252#L11-1 assume !!(main_~i~0 < main_~j~0); 14251#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14250#L12-2 assume true; 14249#L11-1 assume !!(main_~i~0 < main_~j~0); 14248#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14247#L12-2 assume true; 14246#L11-1 assume !!(main_~i~0 < main_~j~0); 14245#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14244#L12-2 assume true; 14243#L11-1 assume !!(main_~i~0 < main_~j~0); 14242#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14241#L12-2 assume true; 14240#L11-1 assume !!(main_~i~0 < main_~j~0); 14239#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14238#L12-2 assume true; 14237#L11-1 assume !!(main_~i~0 < main_~j~0); 14236#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14235#L12-2 assume true; 14234#L11-1 assume !!(main_~i~0 < main_~j~0); 14233#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14232#L12-2 assume true; 14231#L11-1 assume !!(main_~i~0 < main_~j~0); 14230#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14229#L12-2 assume true; 14228#L11-1 assume !!(main_~i~0 < main_~j~0); 14227#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14226#L12-2 assume true; 14225#L11-1 assume !!(main_~i~0 < main_~j~0); 14224#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14223#L12-2 assume true; 14222#L11-1 assume !!(main_~i~0 < main_~j~0); 14221#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14220#L12-2 assume true; 14219#L11-1 assume !!(main_~i~0 < main_~j~0); 14218#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14217#L12-2 assume true; 14216#L11-1 assume !!(main_~i~0 < main_~j~0); 14215#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14214#L12-2 assume true; 14213#L11-1 assume !!(main_~i~0 < main_~j~0); 14212#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14211#L12-2 assume true; 14210#L11-1 assume !!(main_~i~0 < main_~j~0); 14209#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14208#L12-2 assume true; 14207#L11-1 assume !!(main_~i~0 < main_~j~0); 14206#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14205#L12-2 assume true; 14204#L11-1 assume !!(main_~i~0 < main_~j~0); 14203#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14202#L12-2 assume true; 14201#L11-1 assume !!(main_~i~0 < main_~j~0); 14200#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14199#L12-2 assume true; 14198#L11-1 assume !!(main_~i~0 < main_~j~0); 14197#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14196#L12-2 assume true; 14195#L11-1 assume !!(main_~i~0 < main_~j~0); 14194#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14193#L12-2 assume true; 14192#L11-1 assume !!(main_~i~0 < main_~j~0); 14191#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14190#L12-2 assume true; 14189#L11-1 assume !!(main_~i~0 < main_~j~0); 14188#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14187#L12-2 assume true; 14185#L11-1 assume !!(main_~i~0 < main_~j~0); 14186#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14184#L12-2 assume true; 14182#L11-1 assume !!(main_~i~0 < main_~j~0); 14183#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 14180#L12-2 assume true; 14181#L11-1 [2018-10-27 06:11:20,993 INFO L795 eck$LassoCheckResult]: Loop: 14181#L11-1 assume !!(main_~i~0 < main_~j~0); 14186#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14184#L12-2 assume true; 14182#L11-1 assume !!(main_~i~0 < main_~j~0); 14183#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 14180#L12-2 assume true; 14181#L11-1 [2018-10-27 06:11:20,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2053562783, now seen corresponding path program 39 times [2018-10-27 06:11:20,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:20,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:20,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 40 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:21,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:21,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-10-27 06:11:21,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:21,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 40 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:21,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-27 06:11:21,767 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:21,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:21,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 36 times [2018-10-27 06:11:21,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:21,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:21,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,195 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-27 06:11:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 06:11:22,276 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. cyclomatic complexity: 3 Second operand 42 states. [2018-10-27 06:11:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:22,349 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-10-27 06:11:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 06:11:22,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 133 transitions. [2018-10-27 06:11:22,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:22,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 129 states and 131 transitions. [2018-10-27 06:11:22,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:22,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:22,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 131 transitions. [2018-10-27 06:11:22,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:22,352 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-10-27 06:11:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 131 transitions. [2018-10-27 06:11:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-27 06:11:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 06:11:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-10-27 06:11:22,354 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-27 06:11:22,354 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-27 06:11:22,354 INFO L442 BuchiCegarLoop]: ======== Iteration 42============ [2018-10-27 06:11:22,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 129 transitions. [2018-10-27 06:11:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:22,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:22,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:22,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [42, 41, 40, 1, 1, 1] [2018-10-27 06:11:22,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:22,367 INFO L793 eck$LassoCheckResult]: Stem: 14846#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14839#L12-2 assume true; 14840#L11-1 assume !!(main_~i~0 < main_~j~0); 14843#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14964#L12-2 assume true; 14844#L11-1 assume !!(main_~i~0 < main_~j~0); 14845#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14841#L12-2 assume true; 14842#L11-1 assume !!(main_~i~0 < main_~j~0); 14963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14962#L12-2 assume true; 14961#L11-1 assume !!(main_~i~0 < main_~j~0); 14960#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14959#L12-2 assume true; 14958#L11-1 assume !!(main_~i~0 < main_~j~0); 14957#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14956#L12-2 assume true; 14955#L11-1 assume !!(main_~i~0 < main_~j~0); 14954#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14953#L12-2 assume true; 14952#L11-1 assume !!(main_~i~0 < main_~j~0); 14951#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14950#L12-2 assume true; 14949#L11-1 assume !!(main_~i~0 < main_~j~0); 14948#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14947#L12-2 assume true; 14946#L11-1 assume !!(main_~i~0 < main_~j~0); 14945#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14944#L12-2 assume true; 14943#L11-1 assume !!(main_~i~0 < main_~j~0); 14942#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14941#L12-2 assume true; 14940#L11-1 assume !!(main_~i~0 < main_~j~0); 14939#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14938#L12-2 assume true; 14937#L11-1 assume !!(main_~i~0 < main_~j~0); 14936#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14935#L12-2 assume true; 14934#L11-1 assume !!(main_~i~0 < main_~j~0); 14933#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14932#L12-2 assume true; 14931#L11-1 assume !!(main_~i~0 < main_~j~0); 14930#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14929#L12-2 assume true; 14928#L11-1 assume !!(main_~i~0 < main_~j~0); 14927#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14926#L12-2 assume true; 14925#L11-1 assume !!(main_~i~0 < main_~j~0); 14924#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14923#L12-2 assume true; 14922#L11-1 assume !!(main_~i~0 < main_~j~0); 14921#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14920#L12-2 assume true; 14919#L11-1 assume !!(main_~i~0 < main_~j~0); 14918#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14917#L12-2 assume true; 14916#L11-1 assume !!(main_~i~0 < main_~j~0); 14915#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14914#L12-2 assume true; 14913#L11-1 assume !!(main_~i~0 < main_~j~0); 14912#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14911#L12-2 assume true; 14910#L11-1 assume !!(main_~i~0 < main_~j~0); 14909#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14908#L12-2 assume true; 14907#L11-1 assume !!(main_~i~0 < main_~j~0); 14906#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14905#L12-2 assume true; 14904#L11-1 assume !!(main_~i~0 < main_~j~0); 14903#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14902#L12-2 assume true; 14901#L11-1 assume !!(main_~i~0 < main_~j~0); 14900#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14899#L12-2 assume true; 14898#L11-1 assume !!(main_~i~0 < main_~j~0); 14897#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14896#L12-2 assume true; 14895#L11-1 assume !!(main_~i~0 < main_~j~0); 14894#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14893#L12-2 assume true; 14892#L11-1 assume !!(main_~i~0 < main_~j~0); 14891#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14890#L12-2 assume true; 14889#L11-1 assume !!(main_~i~0 < main_~j~0); 14888#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14887#L12-2 assume true; 14886#L11-1 assume !!(main_~i~0 < main_~j~0); 14885#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14884#L12-2 assume true; 14883#L11-1 assume !!(main_~i~0 < main_~j~0); 14882#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14881#L12-2 assume true; 14880#L11-1 assume !!(main_~i~0 < main_~j~0); 14879#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14878#L12-2 assume true; 14877#L11-1 assume !!(main_~i~0 < main_~j~0); 14876#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14875#L12-2 assume true; 14874#L11-1 assume !!(main_~i~0 < main_~j~0); 14873#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14872#L12-2 assume true; 14871#L11-1 assume !!(main_~i~0 < main_~j~0); 14870#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14869#L12-2 assume true; 14868#L11-1 assume !!(main_~i~0 < main_~j~0); 14867#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14866#L12-2 assume true; 14865#L11-1 assume !!(main_~i~0 < main_~j~0); 14864#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14863#L12-2 assume true; 14862#L11-1 assume !!(main_~i~0 < main_~j~0); 14861#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14860#L12-2 assume true; 14859#L11-1 assume !!(main_~i~0 < main_~j~0); 14858#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14857#L12-2 assume true; 14856#L11-1 assume !!(main_~i~0 < main_~j~0); 14855#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14854#L12-2 assume true; 14852#L11-1 assume !!(main_~i~0 < main_~j~0); 14853#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14851#L12-2 assume true; 14849#L11-1 assume !!(main_~i~0 < main_~j~0); 14850#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 14847#L12-2 assume true; 14848#L11-1 [2018-10-27 06:11:22,368 INFO L795 eck$LassoCheckResult]: Loop: 14848#L11-1 assume !!(main_~i~0 < main_~j~0); 14853#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 14851#L12-2 assume true; 14849#L11-1 assume !!(main_~i~0 < main_~j~0); 14850#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 14847#L12-2 assume true; 14848#L11-1 [2018-10-27 06:11:22,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -176539106, now seen corresponding path program 40 times [2018-10-27 06:11:22,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 41 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:23,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:23,016 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:23,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:23,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:23,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 41 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:23,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-27 06:11:23,085 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:23,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:23,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 37 times [2018-10-27 06:11:23,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:23,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:23,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:23,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:23,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-27 06:11:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 06:11:23,114 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. cyclomatic complexity: 3 Second operand 43 states. [2018-10-27 06:11:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:23,193 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-10-27 06:11:23,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 06:11:23,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 136 transitions. [2018-10-27 06:11:23,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:23,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 132 states and 134 transitions. [2018-10-27 06:11:23,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:23,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:23,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 134 transitions. [2018-10-27 06:11:23,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:23,197 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-10-27 06:11:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 134 transitions. [2018-10-27 06:11:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-27 06:11:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 06:11:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-10-27 06:11:23,199 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-10-27 06:11:23,199 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-10-27 06:11:23,199 INFO L442 BuchiCegarLoop]: ======== Iteration 43============ [2018-10-27 06:11:23,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 132 transitions. [2018-10-27 06:11:23,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:23,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:23,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:23,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 41, 1, 1, 1] [2018-10-27 06:11:23,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:23,200 INFO L793 eck$LassoCheckResult]: Stem: 15528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15520#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 15521#L12-2 assume true; 15522#L11-1 assume !!(main_~i~0 < main_~j~0); 15525#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15649#L12-2 assume true; 15526#L11-1 assume !!(main_~i~0 < main_~j~0); 15527#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15523#L12-2 assume true; 15524#L11-1 assume !!(main_~i~0 < main_~j~0); 15648#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15647#L12-2 assume true; 15646#L11-1 assume !!(main_~i~0 < main_~j~0); 15645#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15644#L12-2 assume true; 15643#L11-1 assume !!(main_~i~0 < main_~j~0); 15642#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15641#L12-2 assume true; 15640#L11-1 assume !!(main_~i~0 < main_~j~0); 15639#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15638#L12-2 assume true; 15637#L11-1 assume !!(main_~i~0 < main_~j~0); 15636#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15635#L12-2 assume true; 15634#L11-1 assume !!(main_~i~0 < main_~j~0); 15633#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15632#L12-2 assume true; 15631#L11-1 assume !!(main_~i~0 < main_~j~0); 15630#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15629#L12-2 assume true; 15628#L11-1 assume !!(main_~i~0 < main_~j~0); 15627#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15626#L12-2 assume true; 15625#L11-1 assume !!(main_~i~0 < main_~j~0); 15624#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15623#L12-2 assume true; 15622#L11-1 assume !!(main_~i~0 < main_~j~0); 15621#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15620#L12-2 assume true; 15619#L11-1 assume !!(main_~i~0 < main_~j~0); 15618#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15617#L12-2 assume true; 15616#L11-1 assume !!(main_~i~0 < main_~j~0); 15615#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15614#L12-2 assume true; 15613#L11-1 assume !!(main_~i~0 < main_~j~0); 15612#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15611#L12-2 assume true; 15610#L11-1 assume !!(main_~i~0 < main_~j~0); 15609#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15608#L12-2 assume true; 15607#L11-1 assume !!(main_~i~0 < main_~j~0); 15606#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15605#L12-2 assume true; 15604#L11-1 assume !!(main_~i~0 < main_~j~0); 15603#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15602#L12-2 assume true; 15601#L11-1 assume !!(main_~i~0 < main_~j~0); 15600#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15599#L12-2 assume true; 15598#L11-1 assume !!(main_~i~0 < main_~j~0); 15597#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15596#L12-2 assume true; 15595#L11-1 assume !!(main_~i~0 < main_~j~0); 15594#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15593#L12-2 assume true; 15592#L11-1 assume !!(main_~i~0 < main_~j~0); 15591#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15590#L12-2 assume true; 15589#L11-1 assume !!(main_~i~0 < main_~j~0); 15588#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15587#L12-2 assume true; 15586#L11-1 assume !!(main_~i~0 < main_~j~0); 15585#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15584#L12-2 assume true; 15583#L11-1 assume !!(main_~i~0 < main_~j~0); 15582#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15581#L12-2 assume true; 15580#L11-1 assume !!(main_~i~0 < main_~j~0); 15579#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15578#L12-2 assume true; 15577#L11-1 assume !!(main_~i~0 < main_~j~0); 15576#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15575#L12-2 assume true; 15574#L11-1 assume !!(main_~i~0 < main_~j~0); 15573#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15572#L12-2 assume true; 15571#L11-1 assume !!(main_~i~0 < main_~j~0); 15570#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15569#L12-2 assume true; 15568#L11-1 assume !!(main_~i~0 < main_~j~0); 15567#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15566#L12-2 assume true; 15565#L11-1 assume !!(main_~i~0 < main_~j~0); 15564#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15563#L12-2 assume true; 15562#L11-1 assume !!(main_~i~0 < main_~j~0); 15561#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15560#L12-2 assume true; 15559#L11-1 assume !!(main_~i~0 < main_~j~0); 15558#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15557#L12-2 assume true; 15556#L11-1 assume !!(main_~i~0 < main_~j~0); 15555#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15554#L12-2 assume true; 15553#L11-1 assume !!(main_~i~0 < main_~j~0); 15552#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15551#L12-2 assume true; 15550#L11-1 assume !!(main_~i~0 < main_~j~0); 15549#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15548#L12-2 assume true; 15547#L11-1 assume !!(main_~i~0 < main_~j~0); 15546#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15545#L12-2 assume true; 15544#L11-1 assume !!(main_~i~0 < main_~j~0); 15543#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15542#L12-2 assume true; 15541#L11-1 assume !!(main_~i~0 < main_~j~0); 15540#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15539#L12-2 assume true; 15538#L11-1 assume !!(main_~i~0 < main_~j~0); 15537#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15536#L12-2 assume true; 15534#L11-1 assume !!(main_~i~0 < main_~j~0); 15535#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15533#L12-2 assume true; 15531#L11-1 assume !!(main_~i~0 < main_~j~0); 15532#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 15529#L12-2 assume true; 15530#L11-1 [2018-10-27 06:11:23,200 INFO L795 eck$LassoCheckResult]: Loop: 15530#L11-1 assume !!(main_~i~0 < main_~j~0); 15535#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 15533#L12-2 assume true; 15531#L11-1 assume !!(main_~i~0 < main_~j~0); 15532#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 15529#L12-2 assume true; 15530#L11-1 [2018-10-27 06:11:23,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2056595777, now seen corresponding path program 41 times [2018-10-27 06:11:23,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:23,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 42 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:23,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:23,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:23,996 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:24,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-27 06:11:24,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:24,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 42 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:24,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:24,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-27 06:11:24,097 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:24,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 38 times [2018-10-27 06:11:24,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:24,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-27 06:11:24,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 06:11:24,167 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. cyclomatic complexity: 3 Second operand 44 states. [2018-10-27 06:11:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:24,247 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-10-27 06:11:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-27 06:11:24,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 139 transitions. [2018-10-27 06:11:24,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:24,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 135 states and 137 transitions. [2018-10-27 06:11:24,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:24,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:24,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 137 transitions. [2018-10-27 06:11:24,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:24,250 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-10-27 06:11:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 137 transitions. [2018-10-27 06:11:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-27 06:11:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 06:11:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-27 06:11:24,252 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-27 06:11:24,252 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-27 06:11:24,252 INFO L442 BuchiCegarLoop]: ======== Iteration 44============ [2018-10-27 06:11:24,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 135 transitions. [2018-10-27 06:11:24,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:24,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:24,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:24,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 42, 1, 1, 1] [2018-10-27 06:11:24,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:24,254 INFO L793 eck$LassoCheckResult]: Stem: 16226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 16219#L12-2 assume true; 16220#L11-1 assume !!(main_~i~0 < main_~j~0); 16223#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16350#L12-2 assume true; 16224#L11-1 assume !!(main_~i~0 < main_~j~0); 16225#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16221#L12-2 assume true; 16222#L11-1 assume !!(main_~i~0 < main_~j~0); 16349#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16348#L12-2 assume true; 16347#L11-1 assume !!(main_~i~0 < main_~j~0); 16346#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16345#L12-2 assume true; 16344#L11-1 assume !!(main_~i~0 < main_~j~0); 16343#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16342#L12-2 assume true; 16341#L11-1 assume !!(main_~i~0 < main_~j~0); 16340#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16339#L12-2 assume true; 16338#L11-1 assume !!(main_~i~0 < main_~j~0); 16337#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16336#L12-2 assume true; 16335#L11-1 assume !!(main_~i~0 < main_~j~0); 16334#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16333#L12-2 assume true; 16332#L11-1 assume !!(main_~i~0 < main_~j~0); 16331#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16330#L12-2 assume true; 16329#L11-1 assume !!(main_~i~0 < main_~j~0); 16328#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16327#L12-2 assume true; 16326#L11-1 assume !!(main_~i~0 < main_~j~0); 16325#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16324#L12-2 assume true; 16323#L11-1 assume !!(main_~i~0 < main_~j~0); 16322#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16321#L12-2 assume true; 16320#L11-1 assume !!(main_~i~0 < main_~j~0); 16319#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16318#L12-2 assume true; 16317#L11-1 assume !!(main_~i~0 < main_~j~0); 16316#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16315#L12-2 assume true; 16314#L11-1 assume !!(main_~i~0 < main_~j~0); 16313#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16312#L12-2 assume true; 16311#L11-1 assume !!(main_~i~0 < main_~j~0); 16310#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16309#L12-2 assume true; 16308#L11-1 assume !!(main_~i~0 < main_~j~0); 16307#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16306#L12-2 assume true; 16305#L11-1 assume !!(main_~i~0 < main_~j~0); 16304#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16303#L12-2 assume true; 16302#L11-1 assume !!(main_~i~0 < main_~j~0); 16301#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16300#L12-2 assume true; 16299#L11-1 assume !!(main_~i~0 < main_~j~0); 16298#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16297#L12-2 assume true; 16296#L11-1 assume !!(main_~i~0 < main_~j~0); 16295#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16294#L12-2 assume true; 16293#L11-1 assume !!(main_~i~0 < main_~j~0); 16292#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16291#L12-2 assume true; 16290#L11-1 assume !!(main_~i~0 < main_~j~0); 16289#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16288#L12-2 assume true; 16287#L11-1 assume !!(main_~i~0 < main_~j~0); 16286#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16285#L12-2 assume true; 16284#L11-1 assume !!(main_~i~0 < main_~j~0); 16283#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16282#L12-2 assume true; 16281#L11-1 assume !!(main_~i~0 < main_~j~0); 16280#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16279#L12-2 assume true; 16278#L11-1 assume !!(main_~i~0 < main_~j~0); 16277#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16276#L12-2 assume true; 16275#L11-1 assume !!(main_~i~0 < main_~j~0); 16274#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16273#L12-2 assume true; 16272#L11-1 assume !!(main_~i~0 < main_~j~0); 16271#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16270#L12-2 assume true; 16269#L11-1 assume !!(main_~i~0 < main_~j~0); 16268#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16267#L12-2 assume true; 16266#L11-1 assume !!(main_~i~0 < main_~j~0); 16265#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16264#L12-2 assume true; 16263#L11-1 assume !!(main_~i~0 < main_~j~0); 16262#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16261#L12-2 assume true; 16260#L11-1 assume !!(main_~i~0 < main_~j~0); 16259#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16258#L12-2 assume true; 16257#L11-1 assume !!(main_~i~0 < main_~j~0); 16256#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16255#L12-2 assume true; 16254#L11-1 assume !!(main_~i~0 < main_~j~0); 16253#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16252#L12-2 assume true; 16251#L11-1 assume !!(main_~i~0 < main_~j~0); 16250#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16249#L12-2 assume true; 16248#L11-1 assume !!(main_~i~0 < main_~j~0); 16247#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16246#L12-2 assume true; 16245#L11-1 assume !!(main_~i~0 < main_~j~0); 16244#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16243#L12-2 assume true; 16242#L11-1 assume !!(main_~i~0 < main_~j~0); 16241#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16240#L12-2 assume true; 16239#L11-1 assume !!(main_~i~0 < main_~j~0); 16238#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16237#L12-2 assume true; 16236#L11-1 assume !!(main_~i~0 < main_~j~0); 16235#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16234#L12-2 assume true; 16232#L11-1 assume !!(main_~i~0 < main_~j~0); 16233#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16231#L12-2 assume true; 16229#L11-1 assume !!(main_~i~0 < main_~j~0); 16230#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 16227#L12-2 assume true; 16228#L11-1 [2018-10-27 06:11:24,254 INFO L795 eck$LassoCheckResult]: Loop: 16228#L11-1 assume !!(main_~i~0 < main_~j~0); 16233#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16231#L12-2 assume true; 16229#L11-1 assume !!(main_~i~0 < main_~j~0); 16230#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 16227#L12-2 assume true; 16228#L11-1 [2018-10-27 06:11:24,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 334480190, now seen corresponding path program 42 times [2018-10-27 06:11:24,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:24,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:24,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 43 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:26,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:26,838 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:26,896 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-10-27 06:11:26,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:26,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 43 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:26,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:26,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-27 06:11:26,952 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:26,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 39 times [2018-10-27 06:11:26,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:26,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-27 06:11:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 06:11:27,029 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. cyclomatic complexity: 3 Second operand 45 states. [2018-10-27 06:11:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:27,106 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-10-27 06:11:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 06:11:27,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 142 transitions. [2018-10-27 06:11:27,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:27,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 138 states and 140 transitions. [2018-10-27 06:11:27,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:27,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:27,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 140 transitions. [2018-10-27 06:11:27,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:27,108 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-10-27 06:11:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 140 transitions. [2018-10-27 06:11:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-27 06:11:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 06:11:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-10-27 06:11:27,110 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-10-27 06:11:27,110 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-10-27 06:11:27,110 INFO L442 BuchiCegarLoop]: ======== Iteration 45============ [2018-10-27 06:11:27,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 138 transitions. [2018-10-27 06:11:27,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:27,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:27,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:27,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [45, 44, 43, 1, 1, 1] [2018-10-27 06:11:27,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:27,113 INFO L793 eck$LassoCheckResult]: Stem: 16939#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 16933#L12-2 assume true; 16934#L11-1 assume !!(main_~i~0 < main_~j~0); 16937#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16935#L12-2 assume true; 16936#L11-1 assume !!(main_~i~0 < main_~j~0); 16938#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17067#L12-2 assume true; 17066#L11-1 assume !!(main_~i~0 < main_~j~0); 17065#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17064#L12-2 assume true; 17063#L11-1 assume !!(main_~i~0 < main_~j~0); 17062#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17061#L12-2 assume true; 17060#L11-1 assume !!(main_~i~0 < main_~j~0); 17059#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17058#L12-2 assume true; 17057#L11-1 assume !!(main_~i~0 < main_~j~0); 17056#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17055#L12-2 assume true; 17054#L11-1 assume !!(main_~i~0 < main_~j~0); 17053#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17052#L12-2 assume true; 17051#L11-1 assume !!(main_~i~0 < main_~j~0); 17050#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17049#L12-2 assume true; 17048#L11-1 assume !!(main_~i~0 < main_~j~0); 17047#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17046#L12-2 assume true; 17045#L11-1 assume !!(main_~i~0 < main_~j~0); 17044#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17043#L12-2 assume true; 17042#L11-1 assume !!(main_~i~0 < main_~j~0); 17041#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17040#L12-2 assume true; 17039#L11-1 assume !!(main_~i~0 < main_~j~0); 17038#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17037#L12-2 assume true; 17036#L11-1 assume !!(main_~i~0 < main_~j~0); 17035#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17034#L12-2 assume true; 17033#L11-1 assume !!(main_~i~0 < main_~j~0); 17032#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17031#L12-2 assume true; 17030#L11-1 assume !!(main_~i~0 < main_~j~0); 17029#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17028#L12-2 assume true; 17027#L11-1 assume !!(main_~i~0 < main_~j~0); 17026#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17025#L12-2 assume true; 17024#L11-1 assume !!(main_~i~0 < main_~j~0); 17023#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17022#L12-2 assume true; 17021#L11-1 assume !!(main_~i~0 < main_~j~0); 17020#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17019#L12-2 assume true; 17018#L11-1 assume !!(main_~i~0 < main_~j~0); 17017#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17016#L12-2 assume true; 17015#L11-1 assume !!(main_~i~0 < main_~j~0); 17014#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17013#L12-2 assume true; 17012#L11-1 assume !!(main_~i~0 < main_~j~0); 17011#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17010#L12-2 assume true; 17009#L11-1 assume !!(main_~i~0 < main_~j~0); 17008#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17007#L12-2 assume true; 17006#L11-1 assume !!(main_~i~0 < main_~j~0); 17005#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17004#L12-2 assume true; 17003#L11-1 assume !!(main_~i~0 < main_~j~0); 17002#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17001#L12-2 assume true; 17000#L11-1 assume !!(main_~i~0 < main_~j~0); 16999#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16998#L12-2 assume true; 16997#L11-1 assume !!(main_~i~0 < main_~j~0); 16996#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16995#L12-2 assume true; 16994#L11-1 assume !!(main_~i~0 < main_~j~0); 16993#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16992#L12-2 assume true; 16991#L11-1 assume !!(main_~i~0 < main_~j~0); 16990#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16989#L12-2 assume true; 16988#L11-1 assume !!(main_~i~0 < main_~j~0); 16987#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16986#L12-2 assume true; 16985#L11-1 assume !!(main_~i~0 < main_~j~0); 16984#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16983#L12-2 assume true; 16982#L11-1 assume !!(main_~i~0 < main_~j~0); 16981#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16980#L12-2 assume true; 16979#L11-1 assume !!(main_~i~0 < main_~j~0); 16978#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16977#L12-2 assume true; 16976#L11-1 assume !!(main_~i~0 < main_~j~0); 16975#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16974#L12-2 assume true; 16973#L11-1 assume !!(main_~i~0 < main_~j~0); 16972#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16971#L12-2 assume true; 16970#L11-1 assume !!(main_~i~0 < main_~j~0); 16969#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16968#L12-2 assume true; 16967#L11-1 assume !!(main_~i~0 < main_~j~0); 16966#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16965#L12-2 assume true; 16964#L11-1 assume !!(main_~i~0 < main_~j~0); 16963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16962#L12-2 assume true; 16961#L11-1 assume !!(main_~i~0 < main_~j~0); 16960#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16959#L12-2 assume true; 16958#L11-1 assume !!(main_~i~0 < main_~j~0); 16957#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16956#L12-2 assume true; 16955#L11-1 assume !!(main_~i~0 < main_~j~0); 16954#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16953#L12-2 assume true; 16952#L11-1 assume !!(main_~i~0 < main_~j~0); 16951#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16950#L12-2 assume true; 16949#L11-1 assume !!(main_~i~0 < main_~j~0); 16948#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16947#L12-2 assume true; 16945#L11-1 assume !!(main_~i~0 < main_~j~0); 16946#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16944#L12-2 assume true; 16942#L11-1 assume !!(main_~i~0 < main_~j~0); 16943#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 16940#L12-2 assume true; 16941#L11-1 [2018-10-27 06:11:27,113 INFO L795 eck$LassoCheckResult]: Loop: 16941#L11-1 assume !!(main_~i~0 < main_~j~0); 16946#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 16944#L12-2 assume true; 16942#L11-1 assume !!(main_~i~0 < main_~j~0); 16943#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 16940#L12-2 assume true; 16941#L11-1 [2018-10-27 06:11:27,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 173378593, now seen corresponding path program 43 times [2018-10-27 06:11:27,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:27,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 44 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:28,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:28,412 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:28,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 44 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-27 06:11:28,507 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:28,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 40 times [2018-10-27 06:11:28,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 06:11:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 06:11:28,548 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. cyclomatic complexity: 3 Second operand 46 states. [2018-10-27 06:11:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:29,346 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-10-27 06:11:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 06:11:29,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 145 transitions. [2018-10-27 06:11:29,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:29,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 141 states and 143 transitions. [2018-10-27 06:11:29,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:29,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:29,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 143 transitions. [2018-10-27 06:11:29,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:29,349 INFO L705 BuchiCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-10-27 06:11:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 143 transitions. [2018-10-27 06:11:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-27 06:11:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-27 06:11:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-10-27 06:11:29,351 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-10-27 06:11:29,351 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-10-27 06:11:29,352 INFO L442 BuchiCegarLoop]: ======== Iteration 46============ [2018-10-27 06:11:29,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 141 transitions. [2018-10-27 06:11:29,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:29,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [46, 45, 44, 1, 1, 1] [2018-10-27 06:11:29,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:29,353 INFO L793 eck$LassoCheckResult]: Stem: 17670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 17663#L12-2 assume true; 17664#L11-1 assume !!(main_~i~0 < main_~j~0); 17667#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17800#L12-2 assume true; 17668#L11-1 assume !!(main_~i~0 < main_~j~0); 17669#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17665#L12-2 assume true; 17666#L11-1 assume !!(main_~i~0 < main_~j~0); 17799#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17798#L12-2 assume true; 17797#L11-1 assume !!(main_~i~0 < main_~j~0); 17796#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17795#L12-2 assume true; 17794#L11-1 assume !!(main_~i~0 < main_~j~0); 17793#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17792#L12-2 assume true; 17791#L11-1 assume !!(main_~i~0 < main_~j~0); 17790#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17789#L12-2 assume true; 17788#L11-1 assume !!(main_~i~0 < main_~j~0); 17787#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17786#L12-2 assume true; 17785#L11-1 assume !!(main_~i~0 < main_~j~0); 17784#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17783#L12-2 assume true; 17782#L11-1 assume !!(main_~i~0 < main_~j~0); 17781#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17780#L12-2 assume true; 17779#L11-1 assume !!(main_~i~0 < main_~j~0); 17778#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17777#L12-2 assume true; 17776#L11-1 assume !!(main_~i~0 < main_~j~0); 17775#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17774#L12-2 assume true; 17773#L11-1 assume !!(main_~i~0 < main_~j~0); 17772#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17771#L12-2 assume true; 17770#L11-1 assume !!(main_~i~0 < main_~j~0); 17769#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17768#L12-2 assume true; 17767#L11-1 assume !!(main_~i~0 < main_~j~0); 17766#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17765#L12-2 assume true; 17764#L11-1 assume !!(main_~i~0 < main_~j~0); 17763#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17762#L12-2 assume true; 17761#L11-1 assume !!(main_~i~0 < main_~j~0); 17760#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17759#L12-2 assume true; 17758#L11-1 assume !!(main_~i~0 < main_~j~0); 17757#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17756#L12-2 assume true; 17755#L11-1 assume !!(main_~i~0 < main_~j~0); 17754#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17753#L12-2 assume true; 17752#L11-1 assume !!(main_~i~0 < main_~j~0); 17751#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17750#L12-2 assume true; 17749#L11-1 assume !!(main_~i~0 < main_~j~0); 17748#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17747#L12-2 assume true; 17746#L11-1 assume !!(main_~i~0 < main_~j~0); 17745#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17744#L12-2 assume true; 17743#L11-1 assume !!(main_~i~0 < main_~j~0); 17742#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17741#L12-2 assume true; 17740#L11-1 assume !!(main_~i~0 < main_~j~0); 17739#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17738#L12-2 assume true; 17737#L11-1 assume !!(main_~i~0 < main_~j~0); 17736#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17735#L12-2 assume true; 17734#L11-1 assume !!(main_~i~0 < main_~j~0); 17733#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17732#L12-2 assume true; 17731#L11-1 assume !!(main_~i~0 < main_~j~0); 17730#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17729#L12-2 assume true; 17728#L11-1 assume !!(main_~i~0 < main_~j~0); 17727#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17726#L12-2 assume true; 17725#L11-1 assume !!(main_~i~0 < main_~j~0); 17724#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17723#L12-2 assume true; 17722#L11-1 assume !!(main_~i~0 < main_~j~0); 17721#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17720#L12-2 assume true; 17719#L11-1 assume !!(main_~i~0 < main_~j~0); 17718#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17717#L12-2 assume true; 17716#L11-1 assume !!(main_~i~0 < main_~j~0); 17715#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17714#L12-2 assume true; 17713#L11-1 assume !!(main_~i~0 < main_~j~0); 17712#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17711#L12-2 assume true; 17710#L11-1 assume !!(main_~i~0 < main_~j~0); 17709#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17708#L12-2 assume true; 17707#L11-1 assume !!(main_~i~0 < main_~j~0); 17706#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17705#L12-2 assume true; 17704#L11-1 assume !!(main_~i~0 < main_~j~0); 17703#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17702#L12-2 assume true; 17701#L11-1 assume !!(main_~i~0 < main_~j~0); 17700#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17699#L12-2 assume true; 17698#L11-1 assume !!(main_~i~0 < main_~j~0); 17697#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17696#L12-2 assume true; 17695#L11-1 assume !!(main_~i~0 < main_~j~0); 17694#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17693#L12-2 assume true; 17692#L11-1 assume !!(main_~i~0 < main_~j~0); 17691#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17690#L12-2 assume true; 17689#L11-1 assume !!(main_~i~0 < main_~j~0); 17688#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17687#L12-2 assume true; 17686#L11-1 assume !!(main_~i~0 < main_~j~0); 17685#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17684#L12-2 assume true; 17683#L11-1 assume !!(main_~i~0 < main_~j~0); 17682#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17681#L12-2 assume true; 17680#L11-1 assume !!(main_~i~0 < main_~j~0); 17679#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17678#L12-2 assume true; 17676#L11-1 assume !!(main_~i~0 < main_~j~0); 17677#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17675#L12-2 assume true; 17673#L11-1 assume !!(main_~i~0 < main_~j~0); 17674#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 17671#L12-2 assume true; 17672#L11-1 [2018-10-27 06:11:29,353 INFO L795 eck$LassoCheckResult]: Loop: 17672#L11-1 assume !!(main_~i~0 < main_~j~0); 17677#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 17675#L12-2 assume true; 17673#L11-1 assume !!(main_~i~0 < main_~j~0); 17674#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 17671#L12-2 assume true; 17672#L11-1 [2018-10-27 06:11:29,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1725828002, now seen corresponding path program 44 times [2018-10-27 06:11:29,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 45 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:30,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:30,083 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:30,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:30,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:30,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 45 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:30,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:30,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-27 06:11:30,171 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:30,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 41 times [2018-10-27 06:11:30,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,595 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:30,751 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:11:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-27 06:11:30,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 06:11:30,762 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. cyclomatic complexity: 3 Second operand 47 states. [2018-10-27 06:11:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:31,332 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-10-27 06:11:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-27 06:11:31,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 148 transitions. [2018-10-27 06:11:31,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:31,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 144 states and 146 transitions. [2018-10-27 06:11:31,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:31,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:31,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 146 transitions. [2018-10-27 06:11:31,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:31,336 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-10-27 06:11:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 146 transitions. [2018-10-27 06:11:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-27 06:11:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-27 06:11:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-10-27 06:11:31,337 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-10-27 06:11:31,337 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-10-27 06:11:31,338 INFO L442 BuchiCegarLoop]: ======== Iteration 47============ [2018-10-27 06:11:31,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 144 transitions. [2018-10-27 06:11:31,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:31,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:31,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:31,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [47, 46, 45, 1, 1, 1] [2018-10-27 06:11:31,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:31,340 INFO L793 eck$LassoCheckResult]: Stem: 18416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 18409#L12-2 assume true; 18410#L11-1 assume !!(main_~i~0 < main_~j~0); 18413#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18549#L12-2 assume true; 18414#L11-1 assume !!(main_~i~0 < main_~j~0); 18415#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18411#L12-2 assume true; 18412#L11-1 assume !!(main_~i~0 < main_~j~0); 18548#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18547#L12-2 assume true; 18546#L11-1 assume !!(main_~i~0 < main_~j~0); 18545#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18544#L12-2 assume true; 18543#L11-1 assume !!(main_~i~0 < main_~j~0); 18542#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18541#L12-2 assume true; 18540#L11-1 assume !!(main_~i~0 < main_~j~0); 18539#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18538#L12-2 assume true; 18537#L11-1 assume !!(main_~i~0 < main_~j~0); 18536#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18535#L12-2 assume true; 18534#L11-1 assume !!(main_~i~0 < main_~j~0); 18533#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18532#L12-2 assume true; 18531#L11-1 assume !!(main_~i~0 < main_~j~0); 18530#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18529#L12-2 assume true; 18528#L11-1 assume !!(main_~i~0 < main_~j~0); 18527#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18526#L12-2 assume true; 18525#L11-1 assume !!(main_~i~0 < main_~j~0); 18524#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18523#L12-2 assume true; 18522#L11-1 assume !!(main_~i~0 < main_~j~0); 18521#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18520#L12-2 assume true; 18519#L11-1 assume !!(main_~i~0 < main_~j~0); 18518#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18517#L12-2 assume true; 18516#L11-1 assume !!(main_~i~0 < main_~j~0); 18515#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18514#L12-2 assume true; 18513#L11-1 assume !!(main_~i~0 < main_~j~0); 18512#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18511#L12-2 assume true; 18510#L11-1 assume !!(main_~i~0 < main_~j~0); 18509#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18508#L12-2 assume true; 18507#L11-1 assume !!(main_~i~0 < main_~j~0); 18506#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18505#L12-2 assume true; 18504#L11-1 assume !!(main_~i~0 < main_~j~0); 18503#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18502#L12-2 assume true; 18501#L11-1 assume !!(main_~i~0 < main_~j~0); 18500#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18499#L12-2 assume true; 18498#L11-1 assume !!(main_~i~0 < main_~j~0); 18497#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18496#L12-2 assume true; 18495#L11-1 assume !!(main_~i~0 < main_~j~0); 18494#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18493#L12-2 assume true; 18492#L11-1 assume !!(main_~i~0 < main_~j~0); 18491#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18490#L12-2 assume true; 18489#L11-1 assume !!(main_~i~0 < main_~j~0); 18488#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18487#L12-2 assume true; 18486#L11-1 assume !!(main_~i~0 < main_~j~0); 18485#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18484#L12-2 assume true; 18483#L11-1 assume !!(main_~i~0 < main_~j~0); 18482#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18481#L12-2 assume true; 18480#L11-1 assume !!(main_~i~0 < main_~j~0); 18479#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18478#L12-2 assume true; 18477#L11-1 assume !!(main_~i~0 < main_~j~0); 18476#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18475#L12-2 assume true; 18474#L11-1 assume !!(main_~i~0 < main_~j~0); 18473#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18472#L12-2 assume true; 18471#L11-1 assume !!(main_~i~0 < main_~j~0); 18470#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18469#L12-2 assume true; 18468#L11-1 assume !!(main_~i~0 < main_~j~0); 18467#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18466#L12-2 assume true; 18465#L11-1 assume !!(main_~i~0 < main_~j~0); 18464#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18463#L12-2 assume true; 18462#L11-1 assume !!(main_~i~0 < main_~j~0); 18461#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18460#L12-2 assume true; 18459#L11-1 assume !!(main_~i~0 < main_~j~0); 18458#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18457#L12-2 assume true; 18456#L11-1 assume !!(main_~i~0 < main_~j~0); 18455#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18454#L12-2 assume true; 18453#L11-1 assume !!(main_~i~0 < main_~j~0); 18452#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18451#L12-2 assume true; 18450#L11-1 assume !!(main_~i~0 < main_~j~0); 18449#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18448#L12-2 assume true; 18447#L11-1 assume !!(main_~i~0 < main_~j~0); 18446#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18445#L12-2 assume true; 18444#L11-1 assume !!(main_~i~0 < main_~j~0); 18443#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18442#L12-2 assume true; 18441#L11-1 assume !!(main_~i~0 < main_~j~0); 18440#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18439#L12-2 assume true; 18438#L11-1 assume !!(main_~i~0 < main_~j~0); 18437#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18436#L12-2 assume true; 18435#L11-1 assume !!(main_~i~0 < main_~j~0); 18434#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18433#L12-2 assume true; 18432#L11-1 assume !!(main_~i~0 < main_~j~0); 18431#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18430#L12-2 assume true; 18429#L11-1 assume !!(main_~i~0 < main_~j~0); 18428#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18427#L12-2 assume true; 18426#L11-1 assume !!(main_~i~0 < main_~j~0); 18425#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18424#L12-2 assume true; 18422#L11-1 assume !!(main_~i~0 < main_~j~0); 18423#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18421#L12-2 assume true; 18419#L11-1 assume !!(main_~i~0 < main_~j~0); 18420#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 18417#L12-2 assume true; 18418#L11-1 [2018-10-27 06:11:31,340 INFO L795 eck$LassoCheckResult]: Loop: 18418#L11-1 assume !!(main_~i~0 < main_~j~0); 18423#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 18421#L12-2 assume true; 18419#L11-1 assume !!(main_~i~0 < main_~j~0); 18420#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 18417#L12-2 assume true; 18418#L11-1 [2018-10-27 06:11:31,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:31,340 INFO L82 PathProgramCache]: Analyzing trace with hash 909657857, now seen corresponding path program 45 times [2018-10-27 06:11:31,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:31,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:31,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:31,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:31,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 46 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:32,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:32,064 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:32,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-10-27 06:11:32,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:32,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 46 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-27 06:11:32,252 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:32,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 42 times [2018-10-27 06:11:32,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:32,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-27 06:11:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 06:11:32,299 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. cyclomatic complexity: 3 Second operand 48 states. [2018-10-27 06:11:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:32,391 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-10-27 06:11:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-27 06:11:32,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 151 transitions. [2018-10-27 06:11:32,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:32,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 147 states and 149 transitions. [2018-10-27 06:11:32,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:32,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:32,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 149 transitions. [2018-10-27 06:11:32,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:32,395 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-10-27 06:11:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 149 transitions. [2018-10-27 06:11:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-27 06:11:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-27 06:11:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-10-27 06:11:32,396 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-27 06:11:32,397 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-27 06:11:32,397 INFO L442 BuchiCegarLoop]: ======== Iteration 48============ [2018-10-27 06:11:32,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 147 transitions. [2018-10-27 06:11:32,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:32,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:32,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:32,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [48, 47, 46, 1, 1, 1] [2018-10-27 06:11:32,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:32,398 INFO L793 eck$LassoCheckResult]: Stem: 19177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 19171#L12-2 assume true; 19172#L11-1 assume !!(main_~i~0 < main_~j~0); 19175#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19173#L12-2 assume true; 19174#L11-1 assume !!(main_~i~0 < main_~j~0); 19176#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19314#L12-2 assume true; 19313#L11-1 assume !!(main_~i~0 < main_~j~0); 19312#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19311#L12-2 assume true; 19310#L11-1 assume !!(main_~i~0 < main_~j~0); 19309#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19308#L12-2 assume true; 19307#L11-1 assume !!(main_~i~0 < main_~j~0); 19306#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19305#L12-2 assume true; 19304#L11-1 assume !!(main_~i~0 < main_~j~0); 19303#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19302#L12-2 assume true; 19301#L11-1 assume !!(main_~i~0 < main_~j~0); 19300#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19299#L12-2 assume true; 19298#L11-1 assume !!(main_~i~0 < main_~j~0); 19297#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19296#L12-2 assume true; 19295#L11-1 assume !!(main_~i~0 < main_~j~0); 19294#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19293#L12-2 assume true; 19292#L11-1 assume !!(main_~i~0 < main_~j~0); 19291#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19290#L12-2 assume true; 19289#L11-1 assume !!(main_~i~0 < main_~j~0); 19288#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19287#L12-2 assume true; 19286#L11-1 assume !!(main_~i~0 < main_~j~0); 19285#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19284#L12-2 assume true; 19283#L11-1 assume !!(main_~i~0 < main_~j~0); 19282#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19281#L12-2 assume true; 19280#L11-1 assume !!(main_~i~0 < main_~j~0); 19279#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19278#L12-2 assume true; 19277#L11-1 assume !!(main_~i~0 < main_~j~0); 19276#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19275#L12-2 assume true; 19274#L11-1 assume !!(main_~i~0 < main_~j~0); 19273#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19272#L12-2 assume true; 19271#L11-1 assume !!(main_~i~0 < main_~j~0); 19270#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19269#L12-2 assume true; 19268#L11-1 assume !!(main_~i~0 < main_~j~0); 19267#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19266#L12-2 assume true; 19265#L11-1 assume !!(main_~i~0 < main_~j~0); 19264#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19263#L12-2 assume true; 19262#L11-1 assume !!(main_~i~0 < main_~j~0); 19261#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19260#L12-2 assume true; 19259#L11-1 assume !!(main_~i~0 < main_~j~0); 19258#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19257#L12-2 assume true; 19256#L11-1 assume !!(main_~i~0 < main_~j~0); 19255#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19254#L12-2 assume true; 19253#L11-1 assume !!(main_~i~0 < main_~j~0); 19252#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19251#L12-2 assume true; 19250#L11-1 assume !!(main_~i~0 < main_~j~0); 19249#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19248#L12-2 assume true; 19247#L11-1 assume !!(main_~i~0 < main_~j~0); 19246#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19245#L12-2 assume true; 19244#L11-1 assume !!(main_~i~0 < main_~j~0); 19243#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19242#L12-2 assume true; 19241#L11-1 assume !!(main_~i~0 < main_~j~0); 19240#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19239#L12-2 assume true; 19238#L11-1 assume !!(main_~i~0 < main_~j~0); 19237#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19236#L12-2 assume true; 19235#L11-1 assume !!(main_~i~0 < main_~j~0); 19234#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19233#L12-2 assume true; 19232#L11-1 assume !!(main_~i~0 < main_~j~0); 19231#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19230#L12-2 assume true; 19229#L11-1 assume !!(main_~i~0 < main_~j~0); 19228#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19227#L12-2 assume true; 19226#L11-1 assume !!(main_~i~0 < main_~j~0); 19225#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19224#L12-2 assume true; 19223#L11-1 assume !!(main_~i~0 < main_~j~0); 19222#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19221#L12-2 assume true; 19220#L11-1 assume !!(main_~i~0 < main_~j~0); 19219#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19218#L12-2 assume true; 19217#L11-1 assume !!(main_~i~0 < main_~j~0); 19216#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19215#L12-2 assume true; 19214#L11-1 assume !!(main_~i~0 < main_~j~0); 19213#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19212#L12-2 assume true; 19211#L11-1 assume !!(main_~i~0 < main_~j~0); 19210#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19209#L12-2 assume true; 19208#L11-1 assume !!(main_~i~0 < main_~j~0); 19207#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19206#L12-2 assume true; 19205#L11-1 assume !!(main_~i~0 < main_~j~0); 19204#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19203#L12-2 assume true; 19202#L11-1 assume !!(main_~i~0 < main_~j~0); 19201#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19200#L12-2 assume true; 19199#L11-1 assume !!(main_~i~0 < main_~j~0); 19198#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19197#L12-2 assume true; 19196#L11-1 assume !!(main_~i~0 < main_~j~0); 19195#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19194#L12-2 assume true; 19193#L11-1 assume !!(main_~i~0 < main_~j~0); 19192#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19191#L12-2 assume true; 19190#L11-1 assume !!(main_~i~0 < main_~j~0); 19189#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19188#L12-2 assume true; 19187#L11-1 assume !!(main_~i~0 < main_~j~0); 19186#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19185#L12-2 assume true; 19183#L11-1 assume !!(main_~i~0 < main_~j~0); 19184#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19182#L12-2 assume true; 19180#L11-1 assume !!(main_~i~0 < main_~j~0); 19181#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 19178#L12-2 assume true; 19179#L11-1 [2018-10-27 06:11:32,398 INFO L795 eck$LassoCheckResult]: Loop: 19179#L11-1 assume !!(main_~i~0 < main_~j~0); 19184#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19182#L12-2 assume true; 19180#L11-1 assume !!(main_~i~0 < main_~j~0); 19181#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 19178#L12-2 assume true; 19179#L11-1 [2018-10-27 06:11:32,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1628254850, now seen corresponding path program 46 times [2018-10-27 06:11:32,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:32,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 47 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:33,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:33,060 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:33,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:11:33,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:11:33,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:33,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 47 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:33,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:33,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-27 06:11:33,178 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:33,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 43 times [2018-10-27 06:11:33,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:33,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-27 06:11:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 06:11:33,217 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. cyclomatic complexity: 3 Second operand 49 states. [2018-10-27 06:11:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:33,358 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-10-27 06:11:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-27 06:11:33,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 154 transitions. [2018-10-27 06:11:33,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:33,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 150 states and 152 transitions. [2018-10-27 06:11:33,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:33,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:33,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 152 transitions. [2018-10-27 06:11:33,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:33,360 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-10-27 06:11:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 152 transitions. [2018-10-27 06:11:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-27 06:11:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 06:11:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-27 06:11:33,362 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-27 06:11:33,362 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-27 06:11:33,362 INFO L442 BuchiCegarLoop]: ======== Iteration 49============ [2018-10-27 06:11:33,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 150 transitions. [2018-10-27 06:11:33,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:33,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:33,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:33,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [49, 48, 47, 1, 1, 1] [2018-10-27 06:11:33,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:33,364 INFO L793 eck$LassoCheckResult]: Stem: 19956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 19949#L12-2 assume true; 19950#L11-1 assume !!(main_~i~0 < main_~j~0); 19953#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20095#L12-2 assume true; 19954#L11-1 assume !!(main_~i~0 < main_~j~0); 19955#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19951#L12-2 assume true; 19952#L11-1 assume !!(main_~i~0 < main_~j~0); 20094#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20093#L12-2 assume true; 20092#L11-1 assume !!(main_~i~0 < main_~j~0); 20091#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20090#L12-2 assume true; 20089#L11-1 assume !!(main_~i~0 < main_~j~0); 20088#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20087#L12-2 assume true; 20086#L11-1 assume !!(main_~i~0 < main_~j~0); 20085#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20084#L12-2 assume true; 20083#L11-1 assume !!(main_~i~0 < main_~j~0); 20082#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20081#L12-2 assume true; 20080#L11-1 assume !!(main_~i~0 < main_~j~0); 20079#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20078#L12-2 assume true; 20077#L11-1 assume !!(main_~i~0 < main_~j~0); 20076#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20075#L12-2 assume true; 20074#L11-1 assume !!(main_~i~0 < main_~j~0); 20073#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20072#L12-2 assume true; 20071#L11-1 assume !!(main_~i~0 < main_~j~0); 20070#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20069#L12-2 assume true; 20068#L11-1 assume !!(main_~i~0 < main_~j~0); 20067#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20066#L12-2 assume true; 20065#L11-1 assume !!(main_~i~0 < main_~j~0); 20064#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20063#L12-2 assume true; 20062#L11-1 assume !!(main_~i~0 < main_~j~0); 20061#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20060#L12-2 assume true; 20059#L11-1 assume !!(main_~i~0 < main_~j~0); 20058#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20057#L12-2 assume true; 20056#L11-1 assume !!(main_~i~0 < main_~j~0); 20055#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20054#L12-2 assume true; 20053#L11-1 assume !!(main_~i~0 < main_~j~0); 20052#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20051#L12-2 assume true; 20050#L11-1 assume !!(main_~i~0 < main_~j~0); 20049#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20048#L12-2 assume true; 20047#L11-1 assume !!(main_~i~0 < main_~j~0); 20046#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20045#L12-2 assume true; 20044#L11-1 assume !!(main_~i~0 < main_~j~0); 20043#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20042#L12-2 assume true; 20041#L11-1 assume !!(main_~i~0 < main_~j~0); 20040#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20039#L12-2 assume true; 20038#L11-1 assume !!(main_~i~0 < main_~j~0); 20037#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20036#L12-2 assume true; 20035#L11-1 assume !!(main_~i~0 < main_~j~0); 20034#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20033#L12-2 assume true; 20032#L11-1 assume !!(main_~i~0 < main_~j~0); 20031#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20030#L12-2 assume true; 20029#L11-1 assume !!(main_~i~0 < main_~j~0); 20028#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20027#L12-2 assume true; 20026#L11-1 assume !!(main_~i~0 < main_~j~0); 20025#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20024#L12-2 assume true; 20023#L11-1 assume !!(main_~i~0 < main_~j~0); 20022#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20021#L12-2 assume true; 20020#L11-1 assume !!(main_~i~0 < main_~j~0); 20019#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20018#L12-2 assume true; 20017#L11-1 assume !!(main_~i~0 < main_~j~0); 20016#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20015#L12-2 assume true; 20014#L11-1 assume !!(main_~i~0 < main_~j~0); 20013#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20012#L12-2 assume true; 20011#L11-1 assume !!(main_~i~0 < main_~j~0); 20010#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20009#L12-2 assume true; 20008#L11-1 assume !!(main_~i~0 < main_~j~0); 20007#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20006#L12-2 assume true; 20005#L11-1 assume !!(main_~i~0 < main_~j~0); 20004#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20003#L12-2 assume true; 20002#L11-1 assume !!(main_~i~0 < main_~j~0); 20001#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20000#L12-2 assume true; 19999#L11-1 assume !!(main_~i~0 < main_~j~0); 19998#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19997#L12-2 assume true; 19996#L11-1 assume !!(main_~i~0 < main_~j~0); 19995#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19994#L12-2 assume true; 19993#L11-1 assume !!(main_~i~0 < main_~j~0); 19992#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19991#L12-2 assume true; 19990#L11-1 assume !!(main_~i~0 < main_~j~0); 19989#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19988#L12-2 assume true; 19987#L11-1 assume !!(main_~i~0 < main_~j~0); 19986#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19985#L12-2 assume true; 19984#L11-1 assume !!(main_~i~0 < main_~j~0); 19983#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19982#L12-2 assume true; 19981#L11-1 assume !!(main_~i~0 < main_~j~0); 19980#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19979#L12-2 assume true; 19978#L11-1 assume !!(main_~i~0 < main_~j~0); 19977#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19976#L12-2 assume true; 19975#L11-1 assume !!(main_~i~0 < main_~j~0); 19974#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19973#L12-2 assume true; 19972#L11-1 assume !!(main_~i~0 < main_~j~0); 19971#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19970#L12-2 assume true; 19969#L11-1 assume !!(main_~i~0 < main_~j~0); 19968#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19967#L12-2 assume true; 19966#L11-1 assume !!(main_~i~0 < main_~j~0); 19965#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19964#L12-2 assume true; 19962#L11-1 assume !!(main_~i~0 < main_~j~0); 19963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19961#L12-2 assume true; 19959#L11-1 assume !!(main_~i~0 < main_~j~0); 19960#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 19957#L12-2 assume true; 19958#L11-1 [2018-10-27 06:11:33,364 INFO L795 eck$LassoCheckResult]: Loop: 19958#L11-1 assume !!(main_~i~0 < main_~j~0); 19963#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 19961#L12-2 assume true; 19959#L11-1 assume !!(main_~i~0 < main_~j~0); 19960#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 19957#L12-2 assume true; 19958#L11-1 [2018-10-27 06:11:33,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash 18569697, now seen corresponding path program 47 times [2018-10-27 06:11:33,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 48 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:34,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:34,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:34,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:11:34,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-27 06:11:34,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:34,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 48 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:34,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:34,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-27 06:11:34,330 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:34,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 44 times [2018-10-27 06:11:34,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:34,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 06:11:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 06:11:34,363 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. cyclomatic complexity: 3 Second operand 50 states. [2018-10-27 06:11:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:34,461 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-10-27 06:11:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-27 06:11:34,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 157 transitions. [2018-10-27 06:11:34,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:34,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 153 states and 155 transitions. [2018-10-27 06:11:34,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:34,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:34,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 155 transitions. [2018-10-27 06:11:34,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:34,464 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-10-27 06:11:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 155 transitions. [2018-10-27 06:11:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-27 06:11:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:11:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-10-27 06:11:34,466 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-10-27 06:11:34,466 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-10-27 06:11:34,466 INFO L442 BuchiCegarLoop]: ======== Iteration 50============ [2018-10-27 06:11:34,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 153 transitions. [2018-10-27 06:11:34,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:34,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:34,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:34,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [50, 49, 48, 1, 1, 1] [2018-10-27 06:11:34,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:34,480 INFO L793 eck$LassoCheckResult]: Stem: 20749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20742#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 20743#L12-2 assume true; 20744#L11-1 assume !!(main_~i~0 < main_~j~0); 20745#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20748#L12-2 assume true; 20746#L11-1 assume !!(main_~i~0 < main_~j~0); 20747#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20892#L12-2 assume true; 20891#L11-1 assume !!(main_~i~0 < main_~j~0); 20890#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20889#L12-2 assume true; 20888#L11-1 assume !!(main_~i~0 < main_~j~0); 20887#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20886#L12-2 assume true; 20885#L11-1 assume !!(main_~i~0 < main_~j~0); 20884#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20883#L12-2 assume true; 20882#L11-1 assume !!(main_~i~0 < main_~j~0); 20881#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20880#L12-2 assume true; 20879#L11-1 assume !!(main_~i~0 < main_~j~0); 20878#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20877#L12-2 assume true; 20876#L11-1 assume !!(main_~i~0 < main_~j~0); 20875#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20874#L12-2 assume true; 20873#L11-1 assume !!(main_~i~0 < main_~j~0); 20872#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20871#L12-2 assume true; 20870#L11-1 assume !!(main_~i~0 < main_~j~0); 20869#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20868#L12-2 assume true; 20867#L11-1 assume !!(main_~i~0 < main_~j~0); 20866#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20865#L12-2 assume true; 20864#L11-1 assume !!(main_~i~0 < main_~j~0); 20863#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20862#L12-2 assume true; 20861#L11-1 assume !!(main_~i~0 < main_~j~0); 20860#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20859#L12-2 assume true; 20858#L11-1 assume !!(main_~i~0 < main_~j~0); 20857#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20856#L12-2 assume true; 20855#L11-1 assume !!(main_~i~0 < main_~j~0); 20854#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20853#L12-2 assume true; 20852#L11-1 assume !!(main_~i~0 < main_~j~0); 20851#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20850#L12-2 assume true; 20849#L11-1 assume !!(main_~i~0 < main_~j~0); 20848#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20847#L12-2 assume true; 20846#L11-1 assume !!(main_~i~0 < main_~j~0); 20845#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20844#L12-2 assume true; 20843#L11-1 assume !!(main_~i~0 < main_~j~0); 20842#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20841#L12-2 assume true; 20840#L11-1 assume !!(main_~i~0 < main_~j~0); 20839#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20838#L12-2 assume true; 20837#L11-1 assume !!(main_~i~0 < main_~j~0); 20836#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20835#L12-2 assume true; 20834#L11-1 assume !!(main_~i~0 < main_~j~0); 20833#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20832#L12-2 assume true; 20831#L11-1 assume !!(main_~i~0 < main_~j~0); 20830#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20829#L12-2 assume true; 20828#L11-1 assume !!(main_~i~0 < main_~j~0); 20827#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20826#L12-2 assume true; 20825#L11-1 assume !!(main_~i~0 < main_~j~0); 20824#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20823#L12-2 assume true; 20822#L11-1 assume !!(main_~i~0 < main_~j~0); 20821#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20820#L12-2 assume true; 20819#L11-1 assume !!(main_~i~0 < main_~j~0); 20818#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20817#L12-2 assume true; 20816#L11-1 assume !!(main_~i~0 < main_~j~0); 20815#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20814#L12-2 assume true; 20813#L11-1 assume !!(main_~i~0 < main_~j~0); 20812#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20811#L12-2 assume true; 20810#L11-1 assume !!(main_~i~0 < main_~j~0); 20809#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20808#L12-2 assume true; 20807#L11-1 assume !!(main_~i~0 < main_~j~0); 20806#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20805#L12-2 assume true; 20804#L11-1 assume !!(main_~i~0 < main_~j~0); 20803#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20802#L12-2 assume true; 20801#L11-1 assume !!(main_~i~0 < main_~j~0); 20800#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20799#L12-2 assume true; 20798#L11-1 assume !!(main_~i~0 < main_~j~0); 20797#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20796#L12-2 assume true; 20795#L11-1 assume !!(main_~i~0 < main_~j~0); 20794#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20793#L12-2 assume true; 20792#L11-1 assume !!(main_~i~0 < main_~j~0); 20791#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20790#L12-2 assume true; 20789#L11-1 assume !!(main_~i~0 < main_~j~0); 20788#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20787#L12-2 assume true; 20786#L11-1 assume !!(main_~i~0 < main_~j~0); 20785#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20784#L12-2 assume true; 20783#L11-1 assume !!(main_~i~0 < main_~j~0); 20782#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20781#L12-2 assume true; 20780#L11-1 assume !!(main_~i~0 < main_~j~0); 20779#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20778#L12-2 assume true; 20777#L11-1 assume !!(main_~i~0 < main_~j~0); 20776#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20775#L12-2 assume true; 20774#L11-1 assume !!(main_~i~0 < main_~j~0); 20773#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20772#L12-2 assume true; 20771#L11-1 assume !!(main_~i~0 < main_~j~0); 20770#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20769#L12-2 assume true; 20768#L11-1 assume !!(main_~i~0 < main_~j~0); 20767#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20766#L12-2 assume true; 20765#L11-1 assume !!(main_~i~0 < main_~j~0); 20764#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20763#L12-2 assume true; 20762#L11-1 assume !!(main_~i~0 < main_~j~0); 20761#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20760#L12-2 assume true; 20759#L11-1 assume !!(main_~i~0 < main_~j~0); 20758#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20757#L12-2 assume true; 20755#L11-1 assume !!(main_~i~0 < main_~j~0); 20756#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20754#L12-2 assume true; 20752#L11-1 assume !!(main_~i~0 < main_~j~0); 20753#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 20750#L12-2 assume true; 20751#L11-1 [2018-10-27 06:11:34,480 INFO L795 eck$LassoCheckResult]: Loop: 20751#L11-1 assume !!(main_~i~0 < main_~j~0); 20756#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 20754#L12-2 assume true; 20752#L11-1 assume !!(main_~i~0 < main_~j~0); 20753#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 20750#L12-2 assume true; 20751#L11-1 [2018-10-27 06:11:34,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash -842772834, now seen corresponding path program 48 times [2018-10-27 06:11:34,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:34,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 49 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:35,200 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:11:35,265 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-10-27 06:11:35,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:35,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 49 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-27 06:11:35,319 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:35,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 45 times [2018-10-27 06:11:35,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-27 06:11:35,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-27 06:11:35,372 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. cyclomatic complexity: 3 Second operand 51 states. [2018-10-27 06:11:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:35,658 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-10-27 06:11:35,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-27 06:11:35,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 160 transitions. [2018-10-27 06:11:35,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:35,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 156 states and 158 transitions. [2018-10-27 06:11:35,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-10-27 06:11:35,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-10-27 06:11:35,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 158 transitions. [2018-10-27 06:11:35,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:35,662 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-10-27 06:11:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 158 transitions. [2018-10-27 06:11:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-27 06:11:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-27 06:11:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-10-27 06:11:35,664 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-10-27 06:11:35,664 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-10-27 06:11:35,664 INFO L442 BuchiCegarLoop]: ======== Iteration 51============ [2018-10-27 06:11:35,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 156 transitions. [2018-10-27 06:11:35,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:35,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:35,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:35,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [51, 50, 49, 1, 1, 1] [2018-10-27 06:11:35,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-10-27 06:11:35,665 INFO L793 eck$LassoCheckResult]: Stem: 21560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 21553#L12-2 assume true; 21554#L11-1 assume !!(main_~i~0 < main_~j~0); 21557#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21705#L12-2 assume true; 21558#L11-1 assume !!(main_~i~0 < main_~j~0); 21559#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21555#L12-2 assume true; 21556#L11-1 assume !!(main_~i~0 < main_~j~0); 21704#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21703#L12-2 assume true; 21702#L11-1 assume !!(main_~i~0 < main_~j~0); 21701#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21700#L12-2 assume true; 21699#L11-1 assume !!(main_~i~0 < main_~j~0); 21698#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21697#L12-2 assume true; 21696#L11-1 assume !!(main_~i~0 < main_~j~0); 21695#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21694#L12-2 assume true; 21693#L11-1 assume !!(main_~i~0 < main_~j~0); 21692#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21691#L12-2 assume true; 21690#L11-1 assume !!(main_~i~0 < main_~j~0); 21689#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21688#L12-2 assume true; 21687#L11-1 assume !!(main_~i~0 < main_~j~0); 21686#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21685#L12-2 assume true; 21684#L11-1 assume !!(main_~i~0 < main_~j~0); 21683#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21682#L12-2 assume true; 21681#L11-1 assume !!(main_~i~0 < main_~j~0); 21680#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21679#L12-2 assume true; 21678#L11-1 assume !!(main_~i~0 < main_~j~0); 21677#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21676#L12-2 assume true; 21675#L11-1 assume !!(main_~i~0 < main_~j~0); 21674#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21673#L12-2 assume true; 21672#L11-1 assume !!(main_~i~0 < main_~j~0); 21671#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21670#L12-2 assume true; 21669#L11-1 assume !!(main_~i~0 < main_~j~0); 21668#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21667#L12-2 assume true; 21666#L11-1 assume !!(main_~i~0 < main_~j~0); 21665#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21664#L12-2 assume true; 21663#L11-1 assume !!(main_~i~0 < main_~j~0); 21662#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21661#L12-2 assume true; 21660#L11-1 assume !!(main_~i~0 < main_~j~0); 21659#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21658#L12-2 assume true; 21657#L11-1 assume !!(main_~i~0 < main_~j~0); 21656#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21655#L12-2 assume true; 21654#L11-1 assume !!(main_~i~0 < main_~j~0); 21653#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21652#L12-2 assume true; 21651#L11-1 assume !!(main_~i~0 < main_~j~0); 21650#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21649#L12-2 assume true; 21648#L11-1 assume !!(main_~i~0 < main_~j~0); 21647#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21646#L12-2 assume true; 21645#L11-1 assume !!(main_~i~0 < main_~j~0); 21644#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21643#L12-2 assume true; 21642#L11-1 assume !!(main_~i~0 < main_~j~0); 21641#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21640#L12-2 assume true; 21639#L11-1 assume !!(main_~i~0 < main_~j~0); 21638#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21637#L12-2 assume true; 21636#L11-1 assume !!(main_~i~0 < main_~j~0); 21635#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21634#L12-2 assume true; 21633#L11-1 assume !!(main_~i~0 < main_~j~0); 21632#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21631#L12-2 assume true; 21630#L11-1 assume !!(main_~i~0 < main_~j~0); 21629#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21628#L12-2 assume true; 21627#L11-1 assume !!(main_~i~0 < main_~j~0); 21626#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21625#L12-2 assume true; 21624#L11-1 assume !!(main_~i~0 < main_~j~0); 21623#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21622#L12-2 assume true; 21621#L11-1 assume !!(main_~i~0 < main_~j~0); 21620#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21619#L12-2 assume true; 21618#L11-1 assume !!(main_~i~0 < main_~j~0); 21617#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21616#L12-2 assume true; 21615#L11-1 assume !!(main_~i~0 < main_~j~0); 21614#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21613#L12-2 assume true; 21612#L11-1 assume !!(main_~i~0 < main_~j~0); 21611#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21610#L12-2 assume true; 21609#L11-1 assume !!(main_~i~0 < main_~j~0); 21608#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21607#L12-2 assume true; 21606#L11-1 assume !!(main_~i~0 < main_~j~0); 21605#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21604#L12-2 assume true; 21603#L11-1 assume !!(main_~i~0 < main_~j~0); 21602#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21601#L12-2 assume true; 21600#L11-1 assume !!(main_~i~0 < main_~j~0); 21599#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21598#L12-2 assume true; 21597#L11-1 assume !!(main_~i~0 < main_~j~0); 21596#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21595#L12-2 assume true; 21594#L11-1 assume !!(main_~i~0 < main_~j~0); 21593#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21592#L12-2 assume true; 21591#L11-1 assume !!(main_~i~0 < main_~j~0); 21590#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21589#L12-2 assume true; 21588#L11-1 assume !!(main_~i~0 < main_~j~0); 21587#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21586#L12-2 assume true; 21585#L11-1 assume !!(main_~i~0 < main_~j~0); 21584#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21583#L12-2 assume true; 21582#L11-1 assume !!(main_~i~0 < main_~j~0); 21581#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21580#L12-2 assume true; 21579#L11-1 assume !!(main_~i~0 < main_~j~0); 21578#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21577#L12-2 assume true; 21576#L11-1 assume !!(main_~i~0 < main_~j~0); 21575#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21574#L12-2 assume true; 21573#L11-1 assume !!(main_~i~0 < main_~j~0); 21572#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21571#L12-2 assume true; 21570#L11-1 assume !!(main_~i~0 < main_~j~0); 21569#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21568#L12-2 assume true; 21566#L11-1 assume !!(main_~i~0 < main_~j~0); 21567#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21565#L12-2 assume true; 21562#L11-1 assume !!(main_~i~0 < main_~j~0); 21564#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 21561#L12-2 assume true; 21563#L11-1 [2018-10-27 06:11:35,665 INFO L795 eck$LassoCheckResult]: Loop: 21563#L11-1 assume !!(main_~i~0 < main_~j~0); 21567#L12 assume 51 < main_~j~0;main_~i~0 := main_~i~0 + 1;main_~j~0 := main_~j~0 - 1; 21565#L12-2 assume true; 21562#L11-1 assume !!(main_~i~0 < main_~j~0); 21564#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := main_~j~0 + 1; 21561#L12-2 assume true; 21563#L11-1 [2018-10-27 06:11:35,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1331479745, now seen corresponding path program 49 times [2018-10-27 06:11:35,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 46 times [2018-10-27 06:11:35,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1768103585, now seen corresponding path program 50 times [2018-10-27 06:11:35,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:37,714 WARN L179 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 411 DAG size of output: 311 [2018-10-27 06:11:37,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:37 BoogieIcfgContainer [2018-10-27 06:11:37,759 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:37,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:37,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:37,759 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:37,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:56" (3/4) ... [2018-10-27 06:11:37,765 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:11:37,811 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a8ab925-4f09-441e-ba13-0bf83efecd43/bin-2019/uautomizer/witness.graphml [2018-10-27 06:11:37,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:37,812 INFO L168 Benchmark]: Toolchain (without parser) took 41770.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 463.5 MB). Free memory was 954.4 MB in the beginning and 1.3 GB in the end (delta: -355.5 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,813 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:37,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.15 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.21 ms. Allocated memory is still 1.0 GB. Free memory is still 942.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:37,813 INFO L168 Benchmark]: Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.2 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,813 INFO L168 Benchmark]: RCFGBuilder took 390.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 939.6 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,814 INFO L168 Benchmark]: BuchiAutomizer took 41071.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -168.1 MB). Peak memory consumption was 584.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,814 INFO L168 Benchmark]: Witness Printer took 52.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:37,828 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.15 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.21 ms. Allocated memory is still 1.0 GB. Free memory is still 942.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.2 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 939.6 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41071.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -168.1 MB). Peak memory consumption was 584.1 MB. Max. memory is 11.5 GB. * Witness Printer took 52.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. 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 54 terminating modules (49 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * j + 103 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 49 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 154 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 51 iterations. TraceHistogramMax:51. Analysis of lassos took 35.2s. Construction of modules took 3.7s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 52. Automata minimization 0.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 102 StatesRemovedByMinimization, 50 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 154 states and ocurred in iteration 50. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 246 SDtfs, 53 SDslu, 2120 SDs, 0 SdLazy, 3485 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN45 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf98 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=48, j=52} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 Loop: [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...