./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Narrowing_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_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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 30c1dcaa423edd95f50127b236ab2e09f14129f4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-10 03:39:54,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:39:54,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:39:54,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:39:54,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:39:54,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:39:54,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:39:54,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:39:54,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:39:54,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:39:54,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:39:54,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:39:54,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:39:54,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:39:54,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:39:54,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:39:54,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:39:54,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:39:54,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:39:54,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:39:54,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:39:54,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:39:54,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:39:54,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:39:54,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:39:54,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:39:54,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:39:54,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:39:54,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:39:54,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:39:54,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:39:54,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:39:54,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:39:54,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:39:54,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:39:54,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:39:54,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 03:39:54,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:39:54,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:39:54,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:39:54,107 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:39:54,107 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:39:54,107 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:39:54,107 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:39:54,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:39:54,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:39:54,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:39:54,109 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:39:54,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:39:54,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:39:54,110 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:39:54,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:39:54,110 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_5a2a4acf-3390-404b-8c8d-73e95832880a/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 -> 30c1dcaa423edd95f50127b236ab2e09f14129f4 [2018-11-10 03:39:54,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:39:54,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:39:54,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:39:54,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:39:54,144 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:39:54,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c [2018-11-10 03:39:54,189 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/data/d9d2b4d45/34e24f123421430cbd935e21c53949bd/FLAG8882a490a [2018-11-10 03:39:54,586 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:39:54,586 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/sv-benchmarks/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c [2018-11-10 03:39:54,590 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/data/d9d2b4d45/34e24f123421430cbd935e21c53949bd/FLAG8882a490a [2018-11-10 03:39:54,600 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/data/d9d2b4d45/34e24f123421430cbd935e21c53949bd [2018-11-10 03:39:54,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:39:54,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:39:54,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:39:54,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:39:54,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:39:54,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4897ecb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54, skipping insertion in model container [2018-11-10 03:39:54,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:39:54,633 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:39:54,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:39:54,734 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:39:54,744 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:39:54,752 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:39:54,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54 WrapperNode [2018-11-10 03:39:54,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:39:54,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:39:54,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:39:54,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:39:54,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:39:54,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:39:54,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:39:54,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:39:54,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2018-11-10 03:39:54,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:39:54,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:39:54,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:39:54,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:39:54,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:39:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:39:54,949 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:39:54,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:39:54 BoogieIcfgContainer [2018-11-10 03:39:54,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:39:54,950 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:39:54,950 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:39:54,952 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:39:54,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:39:54,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:39:54" (1/3) ... [2018-11-10 03:39:54,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a1a953a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:39:54, skipping insertion in model container [2018-11-10 03:39:54,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:39:54,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (2/3) ... [2018-11-10 03:39:54,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a1a953a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:39:54, skipping insertion in model container [2018-11-10 03:39:54,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:39:54,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:39:54" (3/3) ... [2018-11-10 03:39:54,956 INFO L375 chiAutomizerObserver]: Analyzing ICFG Narrowing_false-termination_true-no-overflow.c [2018-11-10 03:39:55,000 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:39:55,001 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:39:55,001 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:39:55,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:39:55,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:39:55,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:39:55,002 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:39:55,002 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:39:55,002 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:39:55,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 03:39:55,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:39:55,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:39:55,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,033 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:39:55,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 03:39:55,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:39:55,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:39:55,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,040 INFO L793 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 15#L26-1true [2018-11-10 03:39:55,040 INFO L795 eck$LassoCheckResult]: Loop: 15#L26-1true assume true; 10#L13-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14#L14true assume !(main_~i~0 == 0); 11#L14-2true assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3#L17-1true assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4#L20-1true assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9#L23-1true assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15#L26-1true [2018-11-10 03:39:55,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 03:39:55,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1162199882, now seen corresponding path program 1 times [2018-11-10 03:39:55,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:55,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:39:55,165 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:39:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:39:55,176 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2018-11-10 03:39:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:55,207 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-11-10 03:39:55,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:39:55,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2018-11-10 03:39:55,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:39:55,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 24 transitions. [2018-11-10 03:39:55,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 03:39:55,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 03:39:55,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-11-10 03:39:55,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:55,214 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-10 03:39:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-11-10 03:39:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 03:39:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 03:39:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-10 03:39:55,236 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-10 03:39:55,236 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-10 03:39:55,236 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:39:55,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-10 03:39:55,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:39:55,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:39:55,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,238 INFO L793 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 46#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 47#L26-1 [2018-11-10 03:39:55,238 INFO L795 eck$LassoCheckResult]: Loop: 47#L26-1 assume true; 61#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 57#L14 assume !(main_~i~0 == 0); 55#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 48#L17-1 assume !(main_~up~0 == 1); 49#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 56#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 47#L26-1 [2018-11-10 03:39:55,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 03:39:55,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1162197960, now seen corresponding path program 1 times [2018-11-10 03:39:55,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:55,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:39:55,282 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:55,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:39:55,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:39:55,282 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 03:39:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:55,346 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2018-11-10 03:39:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:39:55,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2018-11-10 03:39:55,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-10 03:39:55,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. [2018-11-10 03:39:55,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 03:39:55,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 03:39:55,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. [2018-11-10 03:39:55,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:55,352 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2018-11-10 03:39:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. [2018-11-10 03:39:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-10 03:39:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 03:39:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-11-10 03:39:55,355 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-10 03:39:55,355 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-10 03:39:55,355 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:39:55,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2018-11-10 03:39:55,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-10 03:39:55,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:39:55,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,356 INFO L793 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 109#L26-1 [2018-11-10 03:39:55,356 INFO L795 eck$LassoCheckResult]: Loop: 109#L26-1 assume true; 130#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 128#L14 assume !(main_~i~0 == 0); 117#L14-2 assume !(main_~i~0 == main_~range~0); 111#L17-1 assume !(main_~up~0 == 1); 112#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 122#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 109#L26-1 [2018-11-10 03:39:55,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 03:39:55,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1162138376, now seen corresponding path program 1 times [2018-11-10 03:39:55,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 384158454, now seen corresponding path program 1 times [2018-11-10 03:39:55,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,439 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:55,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:55,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:55,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:55,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:55,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:55,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:55,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:55,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 03:39:55,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:55,441 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:55,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,579 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:55,579 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:55,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:55,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:55,590 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:55,590 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:55,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:55,617 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:55,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:55,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:55,653 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:55,654 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:55,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:55,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:55,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:55,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:55,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:55,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:55,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:55,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 03:39:55,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:55,655 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:55,731 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:55,734 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:55,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:55,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:55,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:55,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:55,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:55,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:55,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:55,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:55,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:55,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:55,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:55,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:55,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:55,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:55,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:55,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:55,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:55,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:39:55,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:39:55,754 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:39:55,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:39:55,756 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:39:55,756 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:39:55,756 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 03:39:55,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:39:55,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:55,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:55,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:55,828 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:55,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-10 03:39:55,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 90 states and 130 transitions. Complement of second has 7 states. [2018-11-10 03:39:55,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:39:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 03:39:55,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 03:39:55,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:55,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 03:39:55,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:55,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 03:39:55,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:55,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2018-11-10 03:39:55,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2018-11-10 03:39:55,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 122 transitions. [2018-11-10 03:39:55,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 03:39:55,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-10 03:39:55,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 122 transitions. [2018-11-10 03:39:55,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:55,887 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 122 transitions. [2018-11-10 03:39:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 122 transitions. [2018-11-10 03:39:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-10 03:39:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 03:39:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2018-11-10 03:39:55,892 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 121 transitions. [2018-11-10 03:39:55,893 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 121 transitions. [2018-11-10 03:39:55,893 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:39:55,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 121 transitions. [2018-11-10 03:39:55,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2018-11-10 03:39:55,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 03:39:55,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,895 INFO L793 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 286#L26-1 assume true; 313#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 308#L14 assume main_~i~0 == 0;main_~up~0 := 1; 309#L14-2 [2018-11-10 03:39:55,895 INFO L795 eck$LassoCheckResult]: Loop: 309#L14-2 assume !(main_~i~0 == main_~range~0); 345#L17-1 assume !(main_~up~0 == 1); 343#L20-1 assume !(main_~up~0 == 0); 340#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 338#L26-1 assume true; 339#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 333#L14 assume !(main_~i~0 == 0); 309#L14-2 [2018-11-10 03:39:55,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-10 03:39:55,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1544354718, now seen corresponding path program 1 times [2018-11-10 03:39:55,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -812140903, now seen corresponding path program 1 times [2018-11-10 03:39:55,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:55,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:39:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:39:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:39:55,952 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. cyclomatic complexity: 41 Second operand 3 states. [2018-11-10 03:39:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:55,978 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-10 03:39:55,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:39:55,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2018-11-10 03:39:55,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-10 03:39:55,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 79 transitions. [2018-11-10 03:39:55,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 03:39:55,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 03:39:55,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2018-11-10 03:39:55,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:55,982 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-11-10 03:39:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2018-11-10 03:39:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-11-10 03:39:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 03:39:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-11-10 03:39:55,984 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-10 03:39:55,984 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-10 03:39:55,985 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:39:55,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-11-10 03:39:55,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 03:39:55,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:55,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:55,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,986 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:55,986 INFO L793 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 440#L26-1 assume true; 466#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 473#L14 assume main_~i~0 == 0;main_~up~0 := 1; 474#L14-2 assume !(main_~i~0 == main_~range~0); 480#L17-1 [2018-11-10 03:39:55,986 INFO L795 eck$LassoCheckResult]: Loop: 480#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 458#L20-1 assume !(main_~up~0 == 0); 459#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 479#L26-1 assume true; 486#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 484#L14 assume !(main_~i~0 == 0); 481#L14-2 assume !(main_~i~0 == main_~range~0); 480#L17-1 [2018-11-10 03:39:55,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 889541489, now seen corresponding path program 1 times [2018-11-10 03:39:55,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:55,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash 975681420, now seen corresponding path program 1 times [2018-11-10 03:39:55,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:55,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:55,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1181571556, now seen corresponding path program 1 times [2018-11-10 03:39:56,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,070 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:56,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:56,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:56,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:56,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:56,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:56,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:56,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 03:39:56,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:56,070 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:56,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-11-10 03:39:56,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,177 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:56,177 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:56,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,197 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:56,197 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_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,216 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:56,216 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:56,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,235 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:56,235 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,238 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:56,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:56,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,506 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:56,507 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:56,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:56,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:56,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:56,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:56,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:56,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:56,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 03:39:56,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:56,508 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:56,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,604 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:56,604 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:56,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:56,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:56,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:56,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:56,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:56,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:56,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:39:56,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:56,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:56,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:56,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:56,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:56,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:56,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:56,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:56,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:56,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:56,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:56,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:56,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:56,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:56,619 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:39:56,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:56,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:56,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:56,628 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:39:56,634 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:39:56,635 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:39:56,635 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:39:56,635 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:39:56,635 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:39:56,635 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 03:39:56,636 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:39:56,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:56,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:56,674 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:56,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 65 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-10 03:39:56,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 65 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 107 states and 140 transitions. Complement of second has 7 states. [2018-11-10 03:39:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:39:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 03:39:56,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 03:39:56,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:56,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:39:56,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:56,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 03:39:56,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:56,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 140 transitions. [2018-11-10 03:39:56,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 03:39:56,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 92 states and 121 transitions. [2018-11-10 03:39:56,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 03:39:56,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 03:39:56,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 121 transitions. [2018-11-10 03:39:56,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:56,710 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-10 03:39:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 121 transitions. [2018-11-10 03:39:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-11-10 03:39:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 03:39:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2018-11-10 03:39:56,714 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 115 transitions. [2018-11-10 03:39:56,715 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 115 transitions. [2018-11-10 03:39:56,715 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:39:56,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 115 transitions. [2018-11-10 03:39:56,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 03:39:56,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:56,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:56,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:56,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:56,716 INFO L793 eck$LassoCheckResult]: Stem: 664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 660#L26-1 assume true; 724#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 722#L14 assume !(main_~i~0 == 0); 723#L14-2 assume !(main_~i~0 == main_~range~0); 721#L17-1 assume !(main_~up~0 == 1); 712#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 708#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 706#L26-1 assume true; 702#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 698#L14 assume main_~i~0 == 0;main_~up~0 := 1; 699#L14-2 assume !(main_~i~0 == main_~range~0); 693#L17-1 [2018-11-10 03:39:56,716 INFO L795 eck$LassoCheckResult]: Loop: 693#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 694#L20-1 assume !(main_~up~0 == 0); 665#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 666#L26-1 assume true; 679#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 701#L14 assume !(main_~i~0 == 0); 686#L14-2 assume !(main_~i~0 == main_~range~0); 693#L17-1 [2018-11-10 03:39:56,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1214388770, now seen corresponding path program 1 times [2018-11-10 03:39:56,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:56,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:56,743 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:56,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:56,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:56,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 03:39:56,773 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 975681420, now seen corresponding path program 2 times [2018-11-10 03:39:56,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:56,799 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:56,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:56,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:56,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:56,799 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:56,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:56,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:56,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 03:39:56,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:56,799 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:56,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:56,878 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:56,878 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:56,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:56,926 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:56,926 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_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:56,930 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:56,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:56,949 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:57,172 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:57,175 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:57,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:57,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:57,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:57,176 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:57,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:57,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:57,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:57,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 03:39:57,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:57,176 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:57,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:57,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:57,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:57,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:57,252 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:57,252 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:57,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:57,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:57,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:57,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:57,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:57,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:57,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:57,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:57,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:57,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:57,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:57,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:57,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:57,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:57,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:57,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:39:57,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:57,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:57,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:57,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:57,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:57,275 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:39:57,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:57,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:57,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:57,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:39:57,288 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:39:57,288 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:39:57,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:39:57,288 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:39:57,288 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:39:57,288 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 03:39:57,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:39:57,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:57,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34 Second operand 4 states. [2018-11-10 03:39:57,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 114 states and 154 transitions. Complement of second has 7 states. [2018-11-10 03:39:57,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:39:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 03:39:57,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:39:57,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:57,343 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:39:57,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:57,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34 Second operand 4 states. [2018-11-10 03:39:57,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 147 states and 196 transitions. Complement of second has 9 states. [2018-11-10 03:39:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:39:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-10 03:39:57,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:39:57,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:57,408 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:39:57,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,431 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 3 loop predicates [2018-11-10 03:39:57,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34 Second operand 4 states. [2018-11-10 03:39:57,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 115 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 135 states and 187 transitions. Complement of second has 8 states. [2018-11-10 03:39:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:39:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-10 03:39:57,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:39:57,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:57,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 03:39:57,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:57,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 03:39:57,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:57,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 187 transitions. [2018-11-10 03:39:57,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-10 03:39:57,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 101 states and 137 transitions. [2018-11-10 03:39:57,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 03:39:57,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 03:39:57,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 137 transitions. [2018-11-10 03:39:57,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:57,455 INFO L705 BuchiCegarLoop]: Abstraction has 101 states and 137 transitions. [2018-11-10 03:39:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 137 transitions. [2018-11-10 03:39:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 59. [2018-11-10 03:39:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 03:39:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-11-10 03:39:57,458 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-11-10 03:39:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:39:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:39:57,458 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 4 states. [2018-11-10 03:39:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:57,482 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2018-11-10 03:39:57,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:39:57,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 187 transitions. [2018-11-10 03:39:57,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-11-10 03:39:57,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 184 transitions. [2018-11-10 03:39:57,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 03:39:57,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-10 03:39:57,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2018-11-10 03:39:57,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:57,486 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-11-10 03:39:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2018-11-10 03:39:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2018-11-10 03:39:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 03:39:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2018-11-10 03:39:57,495 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 171 transitions. [2018-11-10 03:39:57,495 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 171 transitions. [2018-11-10 03:39:57,495 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:39:57,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 171 transitions. [2018-11-10 03:39:57,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-11-10 03:39:57,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:57,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:57,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:39:57,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:39:57,497 INFO L793 eck$LassoCheckResult]: Stem: 1615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1610#L26-1 assume true; 1635#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1675#L14 assume main_~i~0 == 0;main_~up~0 := 1; 1673#L14-2 assume !(main_~i~0 == main_~range~0); 1660#L17-1 [2018-11-10 03:39:57,497 INFO L795 eck$LassoCheckResult]: Loop: 1660#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 1671#L20-1 assume !(main_~up~0 == 0); 1697#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1667#L26-1 assume true; 1664#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1665#L14 assume !(main_~i~0 == 0); 1661#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 1650#L17-1 assume !(main_~up~0 == 1); 1659#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 1657#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1658#L26-1 assume true; 1717#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1715#L14 assume !(main_~i~0 == 0); 1649#L14-2 assume !(main_~i~0 == main_~range~0); 1648#L17-1 assume !(main_~up~0 == 1); 1647#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 1645#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1646#L26-1 assume true; 1653#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1651#L14 assume main_~i~0 == 0;main_~up~0 := 1; 1652#L14-2 assume !(main_~i~0 == main_~range~0); 1660#L17-1 [2018-11-10 03:39:57,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 889541489, now seen corresponding path program 2 times [2018-11-10 03:39:57,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:57,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:57,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash 450305196, now seen corresponding path program 1 times [2018-11-10 03:39:57,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:57,616 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:57,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:57,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 03:39:57,701 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:57,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:39:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:39:57,701 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. cyclomatic complexity: 48 Second operand 13 states. [2018-11-10 03:39:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:57,838 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-11-10 03:39:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:39:57,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 187 transitions. [2018-11-10 03:39:57,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2018-11-10 03:39:57,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 148 states and 167 transitions. [2018-11-10 03:39:57,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 03:39:57,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-10 03:39:57,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 167 transitions. [2018-11-10 03:39:57,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:57,843 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-11-10 03:39:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 167 transitions. [2018-11-10 03:39:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-11-10 03:39:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 03:39:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2018-11-10 03:39:57,849 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-11-10 03:39:57,850 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-11-10 03:39:57,850 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:39:57,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 146 transitions. [2018-11-10 03:39:57,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2018-11-10 03:39:57,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:57,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:57,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:57,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:57,853 INFO L793 eck$LassoCheckResult]: Stem: 2000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1999#L26-1 assume true; 2026#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2023#L14 assume !(main_~i~0 == 0); 2024#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2033#L17-1 assume !(main_~up~0 == 1); 2119#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2116#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2117#L26-1 assume true; 2079#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2080#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2013#L14-2 [2018-11-10 03:39:57,853 INFO L795 eck$LassoCheckResult]: Loop: 2013#L14-2 assume !(main_~i~0 == main_~range~0); 2014#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 2114#L20-1 assume !(main_~up~0 == 0); 2112#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2110#L26-1 assume true; 2108#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2073#L14 assume !(main_~i~0 == 0); 2042#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2096#L17-1 assume !(main_~up~0 == 1); 2094#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2090#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2081#L26-1 assume true; 2078#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2076#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2013#L14-2 [2018-11-10 03:39:57,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 896625361, now seen corresponding path program 1 times [2018-11-10 03:39:57,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:57,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:57,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:57,870 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:57,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:57,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:57,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:57,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 03:39:57,905 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:57,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -810978599, now seen corresponding path program 2 times [2018-11-10 03:39:57,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:57,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:39:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:39:57,967 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-11-10 03:39:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:58,005 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-11-10 03:39:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:39:58,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 141 transitions. [2018-11-10 03:39:58,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 03:39:58,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 121 states and 138 transitions. [2018-11-10 03:39:58,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 03:39:58,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 03:39:58,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 138 transitions. [2018-11-10 03:39:58,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,009 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 138 transitions. [2018-11-10 03:39:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 138 transitions. [2018-11-10 03:39:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2018-11-10 03:39:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 03:39:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2018-11-10 03:39:58,013 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-11-10 03:39:58,013 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-11-10 03:39:58,013 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:39:58,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 125 transitions. [2018-11-10 03:39:58,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:39:58,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:58,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:58,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:58,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-10 03:39:58,014 INFO L793 eck$LassoCheckResult]: Stem: 2296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2295#L26-1 assume true; 2321#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2332#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2330#L14-2 assume !(main_~i~0 == main_~range~0); 2328#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 2314#L20-1 assume !(main_~up~0 == 0); 2315#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2337#L26-1 assume true; 2335#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2333#L14 assume !(main_~i~0 == 0); 2334#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2352#L17-1 [2018-11-10 03:39:58,014 INFO L795 eck$LassoCheckResult]: Loop: 2352#L17-1 assume !(main_~up~0 == 1); 2351#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2301#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2302#L26-1 assume true; 2305#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2306#L14 assume !(main_~i~0 == 0); 2309#L14-2 assume !(main_~i~0 == main_~range~0); 2297#L17-1 assume !(main_~up~0 == 1); 2298#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2384#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2385#L26-1 assume true; 2389#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2316#L14 assume !(main_~i~0 == 0); 2317#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2352#L17-1 [2018-11-10 03:39:58,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1181571558, now seen corresponding path program 1 times [2018-11-10 03:39:58,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:58,038 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:58,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 03:39:58,130 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:58,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1099942175, now seen corresponding path program 1 times [2018-11-10 03:39:58,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:39:58,149 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:39:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:39:58,150 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-10 03:39:58,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:58,189 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2018-11-10 03:39:58,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:39:58,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 132 transitions. [2018-11-10 03:39:58,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:39:58,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 114 states and 130 transitions. [2018-11-10 03:39:58,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-10 03:39:58,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-10 03:39:58,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 130 transitions. [2018-11-10 03:39:58,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,192 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-11-10 03:39:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 130 transitions. [2018-11-10 03:39:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-10 03:39:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 03:39:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-11-10 03:39:58,195 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 03:39:58,195 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 03:39:58,195 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:39:58,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2018-11-10 03:39:58,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:39:58,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:58,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:58,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-10 03:39:58,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:58,201 INFO L793 eck$LassoCheckResult]: Stem: 2568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2567#L26-1 assume true; 2611#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2610#L14 assume !(main_~i~0 == 0); 2608#L14-2 assume !(main_~i~0 == main_~range~0); 2607#L17-1 assume !(main_~up~0 == 1); 2606#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2604#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2576#L26-1 assume true; 2579#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2580#L14 assume !(main_~i~0 == 0); 2588#L14-2 assume !(main_~i~0 == main_~range~0); 2594#L17-1 assume !(main_~up~0 == 1); 2656#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2654#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2652#L26-1 assume true; 2649#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2586#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2587#L14-2 [2018-11-10 03:39:58,201 INFO L795 eck$LassoCheckResult]: Loop: 2587#L14-2 assume !(main_~i~0 == main_~range~0); 2676#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 2675#L20-1 assume !(main_~up~0 == 0); 2647#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2648#L26-1 assume true; 2640#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2641#L14 assume !(main_~i~0 == 0); 2622#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2623#L17-1 assume !(main_~up~0 == 1); 2677#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 2658#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2653#L26-1 assume true; 2651#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2646#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2587#L14-2 [2018-11-10 03:39:58,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1654404742, now seen corresponding path program 2 times [2018-11-10 03:39:58,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:58,230 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:39:58,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:39:58,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:39:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:58,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 03:39:58,277 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:58,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -810978599, now seen corresponding path program 3 times [2018-11-10 03:39:58,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:39:58,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:39:58,312 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-10 03:39:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:58,349 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2018-11-10 03:39:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:39:58,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 183 transitions. [2018-11-10 03:39:58,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 03:39:58,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 160 states and 180 transitions. [2018-11-10 03:39:58,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-10 03:39:58,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 03:39:58,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 180 transitions. [2018-11-10 03:39:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,351 INFO L705 BuchiCegarLoop]: Abstraction has 160 states and 180 transitions. [2018-11-10 03:39:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 180 transitions. [2018-11-10 03:39:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 126. [2018-11-10 03:39:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 03:39:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2018-11-10 03:39:58,354 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 144 transitions. [2018-11-10 03:39:58,354 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 144 transitions. [2018-11-10 03:39:58,354 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:39:58,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 144 transitions. [2018-11-10 03:39:58,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:39:58,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:58,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:58,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:39:58,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-10 03:39:58,355 INFO L793 eck$LassoCheckResult]: Stem: 2913#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2908#L26-1 assume true; 2945#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2944#L14 assume main_~i~0 == 0;main_~up~0 := 1; 2942#L14-2 assume !(main_~i~0 == main_~range~0); 2936#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 2937#L20-1 assume !(main_~up~0 == 0); 2963#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2959#L26-1 assume true; 2960#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2943#L14 assume !(main_~i~0 == 0); 2924#L14-2 assume !(main_~i~0 == main_~range~0); 2911#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 2912#L20-1 assume !(main_~up~0 == 0); 2927#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2969#L26-1 assume true; 2947#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2948#L14 assume !(main_~i~0 == 0); 3019#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3018#L17-1 [2018-11-10 03:39:58,356 INFO L795 eck$LassoCheckResult]: Loop: 3018#L17-1 assume !(main_~up~0 == 1); 3016#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 3017#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3027#L26-1 assume true; 3026#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3025#L14 assume !(main_~i~0 == 0); 3024#L14-2 assume !(main_~i~0 == main_~range~0); 3020#L17-1 assume !(main_~up~0 == 1); 3015#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 3012#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3014#L26-1 assume true; 3023#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3021#L14 assume !(main_~i~0 == 0); 3022#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3018#L17-1 [2018-11-10 03:39:58,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash -265417457, now seen corresponding path program 2 times [2018-11-10 03:39:58,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:58,406 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:39:58,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:39:58,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:39:58,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:58,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:39:58,449 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:58,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1099942175, now seen corresponding path program 2 times [2018-11-10 03:39:58,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:58,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:39:58,462 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:39:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:39:58,462 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. cyclomatic complexity: 24 Second operand 4 states. [2018-11-10 03:39:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:58,480 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2018-11-10 03:39:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:39:58,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 143 transitions. [2018-11-10 03:39:58,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-10 03:39:58,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 143 transitions. [2018-11-10 03:39:58,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 03:39:58,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 03:39:58,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 143 transitions. [2018-11-10 03:39:58,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,482 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 143 transitions. [2018-11-10 03:39:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 143 transitions. [2018-11-10 03:39:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2018-11-10 03:39:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 03:39:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-11-10 03:39:58,484 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-11-10 03:39:58,484 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-11-10 03:39:58,485 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:39:58,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 124 transitions. [2018-11-10 03:39:58,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 03:39:58,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:58,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:58,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:58,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:58,486 INFO L793 eck$LassoCheckResult]: Stem: 3235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 3234#L26-1 assume true; 3260#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3268#L14 assume main_~i~0 == 0;main_~up~0 := 1; 3266#L14-2 assume !(main_~i~0 == main_~range~0); 3263#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3264#L20-1 assume !(main_~up~0 == 0); 3280#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3281#L26-1 assume true; 3341#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3267#L14 assume !(main_~i~0 == 0); 3265#L14-2 assume !(main_~i~0 == main_~range~0); 3262#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3252#L20-1 assume !(main_~up~0 == 0); 3253#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3271#L26-1 assume true; 3269#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3270#L14 assume !(main_~i~0 == 0); 3248#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3236#L17-1 assume !(main_~up~0 == 1); 3237#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 3240#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3241#L26-1 [2018-11-10 03:39:58,486 INFO L795 eck$LassoCheckResult]: Loop: 3241#L26-1 assume true; 3244#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3245#L14 assume !(main_~i~0 == 0); 3254#L14-2 assume !(main_~i~0 == main_~range~0); 3335#L17-1 assume !(main_~up~0 == 1); 3334#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 3333#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3241#L26-1 [2018-11-10 03:39:58,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -16640618, now seen corresponding path program 1 times [2018-11-10 03:39:58,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:58,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-10 03:39:58,572 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:58,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1162138376, now seen corresponding path program 2 times [2018-11-10 03:39:58,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:58,600 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:58,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:58,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:58,600 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:58,600 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:58,600 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:58,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:58,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 03:39:58,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:58,601 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:58,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,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-11-10 03:39:58,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,644 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:58,644 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:58,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:58,649 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:58,649 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:58,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:58,683 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:58,683 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_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:58,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:58,701 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:58,701 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:58,705 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:58,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:58,741 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:58,742 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:58,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:58,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:58,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:58,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:58,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:58,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:58,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:58,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 03:39:58,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:58,743 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:58,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:58,789 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:58,789 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:58,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:58,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:58,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:58,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:58,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:58,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:58,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:58,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:58,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:58,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:58,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:58,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:58,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:39:58,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:58,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:58,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:58,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:58,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:58,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:58,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:58,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:39:58,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:58,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:58,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:58,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:58,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:58,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:58,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:58,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:58,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:58,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:39:58,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:39:58,802 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:39:58,803 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:39:58,803 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:39:58,803 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:39:58,803 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 03:39:58,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:39:58,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:58,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-10 03:39:58,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 221 states and 253 transitions. Complement of second has 7 states. [2018-11-10 03:39:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:39:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 03:39:58,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-10 03:39:58,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:58,857 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:39:58,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,883 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:39:58,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-10 03:39:58,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 221 states and 253 transitions. Complement of second has 7 states. [2018-11-10 03:39:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:39:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 03:39:58,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-10 03:39:58,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:58,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:39:58,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:58,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:58,945 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 3 loop predicates [2018-11-10 03:39:58,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-10 03:39:58,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 124 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 221 states and 256 transitions. Complement of second has 8 states. [2018-11-10 03:39:58,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:39:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:39:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 03:39:58,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-10 03:39:58,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 30 letters. Loop has 7 letters. [2018-11-10 03:39:58,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 23 letters. Loop has 14 letters. [2018-11-10 03:39:58,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:39:58,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 256 transitions. [2018-11-10 03:39:58,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 03:39:58,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 150 states and 170 transitions. [2018-11-10 03:39:58,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 03:39:58,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 03:39:58,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 170 transitions. [2018-11-10 03:39:58,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,966 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-11-10 03:39:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 170 transitions. [2018-11-10 03:39:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2018-11-10 03:39:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 03:39:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-11-10 03:39:58,968 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-11-10 03:39:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:39:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:39:58,968 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 9 states. [2018-11-10 03:39:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:58,996 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-11-10 03:39:58,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:39:58,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 108 transitions. [2018-11-10 03:39:58,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 03:39:58,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 94 states and 105 transitions. [2018-11-10 03:39:58,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:39:58,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:39:58,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 105 transitions. [2018-11-10 03:39:58,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:58,999 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-10 03:39:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 105 transitions. [2018-11-10 03:39:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-11-10 03:39:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 03:39:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-11-10 03:39:59,001 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-11-10 03:39:59,001 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-11-10 03:39:59,001 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:39:59,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 101 transitions. [2018-11-10 03:39:59,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 03:39:59,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:59,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:59,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2018-11-10 03:39:59,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:59,002 INFO L793 eck$LassoCheckResult]: Stem: 4577#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4571#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4572#L26-1 assume true; 4656#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4654#L14 assume !(main_~i~0 == 0); 4652#L14-2 assume !(main_~i~0 == main_~range~0); 4607#L17-1 assume !(main_~up~0 == 1); 4605#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4600#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4601#L26-1 assume true; 4641#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4640#L14 assume !(main_~i~0 == 0); 4639#L14-2 assume !(main_~i~0 == main_~range~0); 4638#L17-1 assume !(main_~up~0 == 1); 4633#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4629#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4616#L26-1 assume true; 4626#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4624#L14 assume !(main_~i~0 == 0); 4622#L14-2 assume !(main_~i~0 == main_~range~0); 4620#L17-1 assume !(main_~up~0 == 1); 4618#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4615#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4614#L26-1 [2018-11-10 03:39:59,002 INFO L795 eck$LassoCheckResult]: Loop: 4614#L26-1 assume true; 4586#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4587#L14 assume main_~i~0 == 0;main_~up~0 := 1; 4599#L14-2 assume !(main_~i~0 == main_~range~0); 4594#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4590#L20-1 assume !(main_~up~0 == 0); 4591#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4628#L26-1 assume true; 4627#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4625#L14 assume !(main_~i~0 == 0); 4623#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4621#L17-1 assume !(main_~up~0 == 1); 4619#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4617#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4614#L26-1 [2018-11-10 03:39:59,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2066026030, now seen corresponding path program 1 times [2018-11-10 03:39:59,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:59,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:59,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:39:59,054 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:59,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 4 times [2018-11-10 03:39:59,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:39:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:39:59,103 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 03:39:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:59,123 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-11-10 03:39:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:39:59,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 113 transitions. [2018-11-10 03:39:59,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 03:39:59,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 113 transitions. [2018-11-10 03:39:59,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 03:39:59,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 03:39:59,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 113 transitions. [2018-11-10 03:39:59,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:59,124 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-10 03:39:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 113 transitions. [2018-11-10 03:39:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-11-10 03:39:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 03:39:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-11-10 03:39:59,127 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-10 03:39:59,127 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-10 03:39:59,127 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 03:39:59,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 108 transitions. [2018-11-10 03:39:59,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:59,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:59,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1] [2018-11-10 03:39:59,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:59,128 INFO L793 eck$LassoCheckResult]: Stem: 4772#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4771#L26-1 assume true; 4808#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4806#L14 assume !(main_~i~0 == 0); 4807#L14-2 assume !(main_~i~0 == main_~range~0); 4804#L17-1 assume !(main_~up~0 == 1); 4803#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4801#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4794#L26-1 assume true; 4783#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4784#L14 assume !(main_~i~0 == 0); 4791#L14-2 assume !(main_~i~0 == main_~range~0); 4855#L17-1 assume !(main_~up~0 == 1); 4853#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4851#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4834#L26-1 assume true; 4849#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4848#L14 assume !(main_~i~0 == 0); 4846#L14-2 assume !(main_~i~0 == main_~range~0); 4847#L17-1 assume !(main_~up~0 == 1); 4854#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4833#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4832#L26-1 [2018-11-10 03:39:59,129 INFO L795 eck$LassoCheckResult]: Loop: 4832#L26-1 assume true; 4781#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4782#L14 assume main_~i~0 == 0;main_~up~0 := 1; 4790#L14-2 assume !(main_~i~0 == main_~range~0); 4795#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4796#L20-1 assume !(main_~up~0 == 0); 4777#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4778#L26-1 assume true; 4841#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4840#L14 assume !(main_~i~0 == 0); 4839#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4838#L17-1 assume !(main_~up~0 == 1); 4837#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 4835#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4832#L26-1 [2018-11-10 03:39:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1256679404, now seen corresponding path program 1 times [2018-11-10 03:39:59,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 5 times [2018-11-10 03:39:59,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:59,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2086531268, now seen corresponding path program 1 times [2018-11-10 03:39:59,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:59,214 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:59,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:59,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:59,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-11-10 03:39:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:39:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:39:59,302 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 03:39:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:59,368 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2018-11-10 03:39:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:39:59,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 189 transitions. [2018-11-10 03:39:59,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 164 states and 180 transitions. [2018-11-10 03:39:59,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:39:59,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:39:59,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 180 transitions. [2018-11-10 03:39:59,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:59,370 INFO L705 BuchiCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-11-10 03:39:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 180 transitions. [2018-11-10 03:39:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2018-11-10 03:39:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 03:39:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-11-10 03:39:59,372 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-11-10 03:39:59,372 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-11-10 03:39:59,372 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 03:39:59,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 138 transitions. [2018-11-10 03:39:59,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:59,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:59,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 1, 1] [2018-11-10 03:39:59,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:59,374 INFO L793 eck$LassoCheckResult]: Stem: 5180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5175#L26-1 assume true; 5249#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5243#L14 assume !(main_~i~0 == 0); 5244#L14-2 assume !(main_~i~0 == main_~range~0); 5212#L17-1 assume !(main_~up~0 == 1); 5210#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5206#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5207#L26-1 assume true; 5297#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5296#L14 assume !(main_~i~0 == 0); 5295#L14-2 assume !(main_~i~0 == main_~range~0); 5293#L17-1 assume !(main_~up~0 == 1); 5291#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5289#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5287#L26-1 assume true; 5282#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5279#L14 assume !(main_~i~0 == 0); 5276#L14-2 assume !(main_~i~0 == main_~range~0); 5273#L17-1 assume !(main_~up~0 == 1); 5270#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5267#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5268#L26-1 assume true; 5283#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5280#L14 assume !(main_~i~0 == 0); 5277#L14-2 assume !(main_~i~0 == main_~range~0); 5274#L17-1 assume !(main_~up~0 == 1); 5271#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5255#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5235#L26-1 assume true; 5254#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5253#L14 assume !(main_~i~0 == 0); 5252#L14-2 assume !(main_~i~0 == main_~range~0); 5250#L17-1 assume !(main_~up~0 == 1); 5251#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5234#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5232#L26-1 [2018-11-10 03:39:59,374 INFO L795 eck$LassoCheckResult]: Loop: 5232#L26-1 assume true; 5185#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5186#L14 assume main_~i~0 == 0;main_~up~0 := 1; 5195#L14-2 assume !(main_~i~0 == main_~range~0); 5198#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5199#L20-1 assume !(main_~up~0 == 0); 5181#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5182#L26-1 assume true; 5242#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5241#L14 assume !(main_~i~0 == 0); 5240#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5239#L17-1 assume !(main_~up~0 == 1); 5238#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5236#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5232#L26-1 [2018-11-10 03:39:59,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2092045004, now seen corresponding path program 2 times [2018-11-10 03:39:59,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 6 times [2018-11-10 03:39:59,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash -422843300, now seen corresponding path program 2 times [2018-11-10 03:39:59,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 58 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:59,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:59,425 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:59,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:39:59,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:39:59,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:39:59,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 58 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:59,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:59,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 03:39:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:39:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:39:59,501 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-10 03:39:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:59,566 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2018-11-10 03:39:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:39:59,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 206 transitions. [2018-11-10 03:39:59,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 185 states and 203 transitions. [2018-11-10 03:39:59,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:39:59,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:39:59,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 203 transitions. [2018-11-10 03:39:59,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:59,569 INFO L705 BuchiCegarLoop]: Abstraction has 185 states and 203 transitions. [2018-11-10 03:39:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 203 transitions. [2018-11-10 03:39:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2018-11-10 03:39:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 03:39:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-11-10 03:39:59,571 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-11-10 03:39:59,571 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-11-10 03:39:59,571 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 03:39:59,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 153 transitions. [2018-11-10 03:39:59,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:59,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:59,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 6, 1, 1] [2018-11-10 03:39:59,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:59,573 INFO L793 eck$LassoCheckResult]: Stem: 5666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5661#L26-1 assume true; 5735#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5729#L14 assume !(main_~i~0 == 0); 5730#L14-2 assume !(main_~i~0 == main_~range~0); 5696#L17-1 assume !(main_~up~0 == 1); 5694#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5689#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5690#L26-1 assume true; 5797#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5796#L14 assume !(main_~i~0 == 0); 5795#L14-2 assume !(main_~i~0 == main_~range~0); 5793#L17-1 assume !(main_~up~0 == 1); 5791#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5789#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5787#L26-1 assume true; 5785#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5783#L14 assume !(main_~i~0 == 0); 5781#L14-2 assume !(main_~i~0 == main_~range~0); 5779#L17-1 assume !(main_~up~0 == 1); 5777#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5775#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5773#L26-1 assume true; 5768#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5765#L14 assume !(main_~i~0 == 0); 5762#L14-2 assume !(main_~i~0 == main_~range~0); 5759#L17-1 assume !(main_~up~0 == 1); 5756#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5753#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5754#L26-1 assume true; 5769#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5766#L14 assume !(main_~i~0 == 0); 5763#L14-2 assume !(main_~i~0 == main_~range~0); 5760#L17-1 assume !(main_~up~0 == 1); 5757#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5741#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5707#L26-1 assume true; 5740#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5739#L14 assume !(main_~i~0 == 0); 5738#L14-2 assume !(main_~i~0 == main_~range~0); 5736#L17-1 assume !(main_~up~0 == 1); 5737#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5706#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5704#L26-1 [2018-11-10 03:39:59,573 INFO L795 eck$LassoCheckResult]: Loop: 5704#L26-1 assume true; 5674#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5675#L14 assume main_~i~0 == 0;main_~up~0 := 1; 5687#L14-2 assume !(main_~i~0 == main_~range~0); 5688#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5723#L20-1 assume !(main_~up~0 == 0); 5722#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5720#L26-1 assume true; 5718#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5716#L14 assume !(main_~i~0 == 0); 5714#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5713#L17-1 assume !(main_~up~0 == 1); 5711#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 5708#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5704#L26-1 [2018-11-10 03:39:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2134151267, now seen corresponding path program 3 times [2018-11-10 03:39:59,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 7 times [2018-11-10 03:39:59,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:59,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1277284683, now seen corresponding path program 3 times [2018-11-10 03:39:59,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:59,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:59,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 69 proven. 123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:59,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:59,647 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:39:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:39:59,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 03:39:59,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:39:59,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 24 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:59,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-11-10 03:39:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:39:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:39:59,769 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. cyclomatic complexity: 19 Second operand 17 states. [2018-11-10 03:39:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:59,993 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2018-11-10 03:39:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 03:39:59,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 282 transitions. [2018-11-10 03:39:59,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 249 states and 270 transitions. [2018-11-10 03:39:59,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:39:59,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:39:59,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 270 transitions. [2018-11-10 03:39:59,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:39:59,996 INFO L705 BuchiCegarLoop]: Abstraction has 249 states and 270 transitions. [2018-11-10 03:39:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 270 transitions. [2018-11-10 03:39:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 132. [2018-11-10 03:39:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 03:39:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-11-10 03:39:59,999 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-11-10 03:39:59,999 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-11-10 03:39:59,999 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 03:39:59,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 144 transitions. [2018-11-10 03:39:59,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:39:59,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:59,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:00,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 7, 7, 1, 1] [2018-11-10 03:40:00,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:00,000 INFO L793 eck$LassoCheckResult]: Stem: 6305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6300#L26-1 assume true; 6371#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6369#L14 assume !(main_~i~0 == 0); 6370#L14-2 assume !(main_~i~0 == main_~range~0); 6337#L17-1 assume !(main_~up~0 == 1); 6335#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6330#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6331#L26-1 assume true; 6430#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6429#L14 assume !(main_~i~0 == 0); 6427#L14-2 assume !(main_~i~0 == main_~range~0); 6426#L17-1 assume !(main_~up~0 == 1); 6425#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6412#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6411#L26-1 assume true; 6410#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6409#L14 assume !(main_~i~0 == 0); 6408#L14-2 assume !(main_~i~0 == main_~range~0); 6407#L17-1 assume !(main_~up~0 == 1); 6406#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6405#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6404#L26-1 assume true; 6403#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6402#L14 assume !(main_~i~0 == 0); 6401#L14-2 assume !(main_~i~0 == main_~range~0); 6400#L17-1 assume !(main_~up~0 == 1); 6399#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6398#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6397#L26-1 assume true; 6396#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6395#L14 assume !(main_~i~0 == 0); 6394#L14-2 assume !(main_~i~0 == main_~range~0); 6393#L17-1 assume !(main_~up~0 == 1); 6392#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6391#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6390#L26-1 assume true; 6388#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6386#L14 assume !(main_~i~0 == 0); 6384#L14-2 assume !(main_~i~0 == main_~range~0); 6382#L17-1 assume !(main_~up~0 == 1); 6380#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6378#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6348#L26-1 assume true; 6377#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6376#L14 assume !(main_~i~0 == 0); 6375#L14-2 assume !(main_~i~0 == main_~range~0); 6374#L17-1 assume !(main_~up~0 == 1); 6373#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6347#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6345#L26-1 [2018-11-10 03:40:00,000 INFO L795 eck$LassoCheckResult]: Loop: 6345#L26-1 assume true; 6313#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6314#L14 assume main_~i~0 == 0;main_~up~0 := 1; 6334#L14-2 assume !(main_~i~0 == main_~range~0); 6323#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 6317#L20-1 assume !(main_~up~0 == 0); 6306#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6307#L26-1 assume true; 6359#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6357#L14 assume !(main_~i~0 == 0); 6355#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6354#L17-1 assume !(main_~up~0 == 1); 6352#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 6349#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6345#L26-1 [2018-11-10 03:40:00,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -428357036, now seen corresponding path program 4 times [2018-11-10 03:40:00,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 8 times [2018-11-10 03:40:00,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1269018244, now seen corresponding path program 4 times [2018-11-10 03:40:00,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:00,079 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:00,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:40:00,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:40:00,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:00,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 03:40:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:40:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:40:00,178 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-10 03:40:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:00,269 INFO L93 Difference]: Finished difference Result 352 states and 374 transitions. [2018-11-10 03:40:00,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 03:40:00,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 374 transitions. [2018-11-10 03:40:00,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 349 states and 371 transitions. [2018-11-10 03:40:00,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:00,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:00,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 371 transitions. [2018-11-10 03:40:00,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:00,274 INFO L705 BuchiCegarLoop]: Abstraction has 349 states and 371 transitions. [2018-11-10 03:40:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 371 transitions. [2018-11-10 03:40:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 139. [2018-11-10 03:40:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 03:40:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-11-10 03:40:00,277 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-11-10 03:40:00,277 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-11-10 03:40:00,277 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 03:40:00,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 151 transitions. [2018-11-10 03:40:00,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:00,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:00,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 8, 1, 1] [2018-11-10 03:40:00,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:00,279 INFO L793 eck$LassoCheckResult]: Stem: 7010#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7005#L26-1 assume true; 7078#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7072#L14 assume !(main_~i~0 == 0); 7073#L14-2 assume !(main_~i~0 == main_~range~0); 7041#L17-1 assume !(main_~up~0 == 1); 7039#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7035#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7036#L26-1 assume true; 7139#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7136#L14 assume !(main_~i~0 == 0); 7133#L14-2 assume !(main_~i~0 == main_~range~0); 7130#L17-1 assume !(main_~up~0 == 1); 7127#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7124#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7125#L26-1 assume true; 7140#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7137#L14 assume !(main_~i~0 == 0); 7134#L14-2 assume !(main_~i~0 == main_~range~0); 7131#L17-1 assume !(main_~up~0 == 1); 7128#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7116#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7115#L26-1 assume true; 7114#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7113#L14 assume !(main_~i~0 == 0); 7112#L14-2 assume !(main_~i~0 == main_~range~0); 7111#L17-1 assume !(main_~up~0 == 1); 7110#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7109#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7108#L26-1 assume true; 7107#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7106#L14 assume !(main_~i~0 == 0); 7105#L14-2 assume !(main_~i~0 == main_~range~0); 7104#L17-1 assume !(main_~up~0 == 1); 7103#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7102#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7101#L26-1 assume true; 7100#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7099#L14 assume !(main_~i~0 == 0); 7098#L14-2 assume !(main_~i~0 == main_~range~0); 7097#L17-1 assume !(main_~up~0 == 1); 7096#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7095#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7094#L26-1 assume true; 7093#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7092#L14 assume !(main_~i~0 == 0); 7091#L14-2 assume !(main_~i~0 == main_~range~0); 7090#L17-1 assume !(main_~up~0 == 1); 7089#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7084#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7064#L26-1 assume true; 7083#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7082#L14 assume !(main_~i~0 == 0); 7081#L14-2 assume !(main_~i~0 == main_~range~0); 7079#L17-1 assume !(main_~up~0 == 1); 7080#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7063#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7061#L26-1 [2018-11-10 03:40:00,279 INFO L795 eck$LassoCheckResult]: Loop: 7061#L26-1 assume true; 7015#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7016#L14 assume main_~i~0 == 0;main_~up~0 := 1; 7024#L14-2 assume !(main_~i~0 == main_~range~0); 7027#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7028#L20-1 assume !(main_~up~0 == 0); 7011#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7012#L26-1 assume true; 7071#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7070#L14 assume !(main_~i~0 == 0); 7069#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7068#L17-1 assume !(main_~up~0 == 1); 7067#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7065#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7061#L26-1 [2018-11-10 03:40:00,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1271770947, now seen corresponding path program 5 times [2018-11-10 03:40:00,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 9 times [2018-11-10 03:40:00,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,295 INFO L82 PathProgramCache]: Analyzing trace with hash -278173653, now seen corresponding path program 5 times [2018-11-10 03:40:00,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 220 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:00,367 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:40:00,398 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-10 03:40:00,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:00,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 220 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:00,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 03:40:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:40:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:40:00,468 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-10 03:40:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:00,636 INFO L93 Difference]: Finished difference Result 289 states and 313 transitions. [2018-11-10 03:40:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 03:40:00,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 313 transitions. [2018-11-10 03:40:00,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 283 states and 307 transitions. [2018-11-10 03:40:00,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:00,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:00,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 307 transitions. [2018-11-10 03:40:00,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:00,639 INFO L705 BuchiCegarLoop]: Abstraction has 283 states and 307 transitions. [2018-11-10 03:40:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 307 transitions. [2018-11-10 03:40:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 146. [2018-11-10 03:40:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:40:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-10 03:40:00,643 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-10 03:40:00,643 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-10 03:40:00,643 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 03:40:00,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 158 transitions. [2018-11-10 03:40:00,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:00,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:00,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 9, 9, 1, 1] [2018-11-10 03:40:00,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:00,645 INFO L793 eck$LassoCheckResult]: Stem: 7700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7695#L26-1 assume true; 7767#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7768#L14 assume !(main_~i~0 == 0); 7830#L14-2 assume !(main_~i~0 == main_~range~0); 7731#L17-1 assume !(main_~up~0 == 1); 7729#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7724#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7725#L26-1 assume true; 7839#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7838#L14 assume !(main_~i~0 == 0); 7837#L14-2 assume !(main_~i~0 == main_~range~0); 7836#L17-1 assume !(main_~up~0 == 1); 7835#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7821#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7820#L26-1 assume true; 7819#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7818#L14 assume !(main_~i~0 == 0); 7817#L14-2 assume !(main_~i~0 == main_~range~0); 7816#L17-1 assume !(main_~up~0 == 1); 7815#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7814#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7813#L26-1 assume true; 7812#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7811#L14 assume !(main_~i~0 == 0); 7810#L14-2 assume !(main_~i~0 == main_~range~0); 7809#L17-1 assume !(main_~up~0 == 1); 7808#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7807#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7806#L26-1 assume true; 7805#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7804#L14 assume !(main_~i~0 == 0); 7803#L14-2 assume !(main_~i~0 == main_~range~0); 7802#L17-1 assume !(main_~up~0 == 1); 7801#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7800#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7799#L26-1 assume true; 7798#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7797#L14 assume !(main_~i~0 == 0); 7796#L14-2 assume !(main_~i~0 == main_~range~0); 7795#L17-1 assume !(main_~up~0 == 1); 7794#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7793#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7792#L26-1 assume true; 7791#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7790#L14 assume !(main_~i~0 == 0); 7789#L14-2 assume !(main_~i~0 == main_~range~0); 7788#L17-1 assume !(main_~up~0 == 1); 7787#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7786#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7785#L26-1 assume true; 7783#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7781#L14 assume !(main_~i~0 == 0); 7779#L14-2 assume !(main_~i~0 == main_~range~0); 7777#L17-1 assume !(main_~up~0 == 1); 7776#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7775#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7742#L26-1 assume true; 7774#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7773#L14 assume !(main_~i~0 == 0); 7772#L14-2 assume !(main_~i~0 == main_~range~0); 7770#L17-1 assume !(main_~up~0 == 1); 7771#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7741#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7739#L26-1 [2018-11-10 03:40:00,645 INFO L795 eck$LassoCheckResult]: Loop: 7739#L26-1 assume true; 7708#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7709#L14 assume main_~i~0 == 0;main_~up~0 := 1; 7722#L14-2 assume !(main_~i~0 == main_~range~0); 7723#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7758#L20-1 assume !(main_~up~0 == 0); 7757#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7755#L26-1 assume true; 7753#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7751#L14 assume !(main_~i~0 == 0); 7749#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7748#L17-1 assume !(main_~up~0 == 1); 7746#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 7743#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7739#L26-1 [2018-11-10 03:40:00,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1274531980, now seen corresponding path program 6 times [2018-11-10 03:40:00,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 10 times [2018-11-10 03:40:00,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1380269724, now seen corresponding path program 6 times [2018-11-10 03:40:00,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 102 proven. 279 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:00,744 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:00,750 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 03:40:00,765 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-10 03:40:00,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:00,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 102 proven. 279 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:00,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:00,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 03:40:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:40:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:40:00,822 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. cyclomatic complexity: 17 Second operand 13 states. [2018-11-10 03:40:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:00,987 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-11-10 03:40:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 03:40:00,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 298 transitions. [2018-11-10 03:40:00,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 269 states and 295 transitions. [2018-11-10 03:40:00,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:00,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:00,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 295 transitions. [2018-11-10 03:40:00,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:00,990 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 295 transitions. [2018-11-10 03:40:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 295 transitions. [2018-11-10 03:40:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2018-11-10 03:40:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 03:40:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-11-10 03:40:00,992 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-11-10 03:40:00,992 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-11-10 03:40:00,992 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 03:40:00,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 165 transitions. [2018-11-10 03:40:00,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:00,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:00,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:00,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 1, 1] [2018-11-10 03:40:00,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:00,994 INFO L793 eck$LassoCheckResult]: Stem: 8406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8401#L26-1 assume true; 8475#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8469#L14 assume !(main_~i~0 == 0); 8470#L14-2 assume !(main_~i~0 == main_~range~0); 8438#L17-1 assume !(main_~up~0 == 1); 8436#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8432#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8433#L26-1 assume true; 8552#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8550#L14 assume !(main_~i~0 == 0); 8548#L14-2 assume !(main_~i~0 == main_~range~0); 8546#L17-1 assume !(main_~up~0 == 1); 8544#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8534#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8533#L26-1 assume true; 8532#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8531#L14 assume !(main_~i~0 == 0); 8530#L14-2 assume !(main_~i~0 == main_~range~0); 8529#L17-1 assume !(main_~up~0 == 1); 8528#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8527#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8526#L26-1 assume true; 8525#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8524#L14 assume !(main_~i~0 == 0); 8523#L14-2 assume !(main_~i~0 == main_~range~0); 8522#L17-1 assume !(main_~up~0 == 1); 8521#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8520#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8519#L26-1 assume true; 8518#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8517#L14 assume !(main_~i~0 == 0); 8516#L14-2 assume !(main_~i~0 == main_~range~0); 8515#L17-1 assume !(main_~up~0 == 1); 8514#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8513#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8512#L26-1 assume true; 8511#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8510#L14 assume !(main_~i~0 == 0); 8509#L14-2 assume !(main_~i~0 == main_~range~0); 8508#L17-1 assume !(main_~up~0 == 1); 8507#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8506#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8505#L26-1 assume true; 8504#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8503#L14 assume !(main_~i~0 == 0); 8502#L14-2 assume !(main_~i~0 == main_~range~0); 8501#L17-1 assume !(main_~up~0 == 1); 8500#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8499#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8498#L26-1 assume true; 8497#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8496#L14 assume !(main_~i~0 == 0); 8495#L14-2 assume !(main_~i~0 == main_~range~0); 8494#L17-1 assume !(main_~up~0 == 1); 8493#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8492#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8491#L26-1 assume true; 8489#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8487#L14 assume !(main_~i~0 == 0); 8485#L14-2 assume !(main_~i~0 == main_~range~0); 8483#L17-1 assume !(main_~up~0 == 1); 8482#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8481#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8461#L26-1 assume true; 8480#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8479#L14 assume !(main_~i~0 == 0); 8478#L14-2 assume !(main_~i~0 == main_~range~0); 8476#L17-1 assume !(main_~up~0 == 1); 8477#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8460#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8458#L26-1 [2018-11-10 03:40:00,994 INFO L795 eck$LassoCheckResult]: Loop: 8458#L26-1 assume true; 8411#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8412#L14 assume main_~i~0 == 0;main_~up~0 := 1; 8421#L14-2 assume !(main_~i~0 == main_~range~0); 8424#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 8425#L20-1 assume !(main_~up~0 == 0); 8407#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8408#L26-1 assume true; 8468#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8467#L14 assume !(main_~i~0 == 0); 8466#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 8465#L17-1 assume !(main_~up~0 == 1); 8464#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 8462#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8458#L26-1 [2018-11-10 03:40:00,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash -283687389, now seen corresponding path program 7 times [2018-11-10 03:40:00,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:00,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 11 times [2018-11-10 03:40:01,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash -818710773, now seen corresponding path program 7 times [2018-11-10 03:40:01,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 113 proven. 345 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:01,110 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:01,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 113 proven. 345 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:01,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-10 03:40:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:40:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:40:01,186 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. cyclomatic complexity: 17 Second operand 13 states. [2018-11-10 03:40:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:01,328 INFO L93 Difference]: Finished difference Result 580 states and 608 transitions. [2018-11-10 03:40:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:40:01,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 608 transitions. [2018-11-10 03:40:01,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:01,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 577 states and 605 transitions. [2018-11-10 03:40:01,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:01,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:01,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 605 transitions. [2018-11-10 03:40:01,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:01,333 INFO L705 BuchiCegarLoop]: Abstraction has 577 states and 605 transitions. [2018-11-10 03:40:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 605 transitions. [2018-11-10 03:40:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 160. [2018-11-10 03:40:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 03:40:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-11-10 03:40:01,337 INFO L728 BuchiCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-11-10 03:40:01,337 INFO L608 BuchiCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-11-10 03:40:01,337 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 03:40:01,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 172 transitions. [2018-11-10 03:40:01,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:01,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:01,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:01,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 11, 11, 1, 1] [2018-11-10 03:40:01,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:01,339 INFO L793 eck$LassoCheckResult]: Stem: 9432#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 9427#L26-1 assume true; 9498#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9494#L14 assume !(main_~i~0 == 0); 9495#L14-2 assume !(main_~i~0 == main_~range~0); 9461#L17-1 assume !(main_~up~0 == 1); 9459#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9454#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9455#L26-1 assume true; 9581#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9578#L14 assume !(main_~i~0 == 0); 9575#L14-2 assume !(main_~i~0 == main_~range~0); 9572#L17-1 assume !(main_~up~0 == 1); 9569#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9566#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9567#L26-1 assume true; 9582#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9579#L14 assume !(main_~i~0 == 0); 9576#L14-2 assume !(main_~i~0 == main_~range~0); 9573#L17-1 assume !(main_~up~0 == 1); 9570#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9558#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9557#L26-1 assume true; 9556#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9555#L14 assume !(main_~i~0 == 0); 9554#L14-2 assume !(main_~i~0 == main_~range~0); 9553#L17-1 assume !(main_~up~0 == 1); 9552#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9551#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9550#L26-1 assume true; 9549#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9548#L14 assume !(main_~i~0 == 0); 9547#L14-2 assume !(main_~i~0 == main_~range~0); 9546#L17-1 assume !(main_~up~0 == 1); 9545#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9544#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9543#L26-1 assume true; 9542#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9541#L14 assume !(main_~i~0 == 0); 9540#L14-2 assume !(main_~i~0 == main_~range~0); 9539#L17-1 assume !(main_~up~0 == 1); 9538#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9537#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9536#L26-1 assume true; 9535#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9534#L14 assume !(main_~i~0 == 0); 9533#L14-2 assume !(main_~i~0 == main_~range~0); 9532#L17-1 assume !(main_~up~0 == 1); 9531#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9530#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9529#L26-1 assume true; 9528#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9527#L14 assume !(main_~i~0 == 0); 9526#L14-2 assume !(main_~i~0 == main_~range~0); 9525#L17-1 assume !(main_~up~0 == 1); 9524#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9523#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9522#L26-1 assume true; 9521#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9520#L14 assume !(main_~i~0 == 0); 9519#L14-2 assume !(main_~i~0 == main_~range~0); 9518#L17-1 assume !(main_~up~0 == 1); 9517#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9516#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9515#L26-1 assume true; 9514#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9513#L14 assume !(main_~i~0 == 0); 9512#L14-2 assume !(main_~i~0 == main_~range~0); 9511#L17-1 assume !(main_~up~0 == 1); 9510#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9505#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9472#L26-1 assume true; 9504#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9503#L14 assume !(main_~i~0 == 0); 9502#L14-2 assume !(main_~i~0 == main_~range~0); 9500#L17-1 assume !(main_~up~0 == 1); 9501#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9471#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9469#L26-1 [2018-11-10 03:40:01,339 INFO L795 eck$LassoCheckResult]: Loop: 9469#L26-1 assume true; 9440#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9441#L14 assume main_~i~0 == 0;main_~up~0 := 1; 9452#L14-2 assume !(main_~i~0 == main_~range~0); 9453#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 9488#L20-1 assume !(main_~up~0 == 0); 9487#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9485#L26-1 assume true; 9483#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9481#L14 assume !(main_~i~0 == 0); 9479#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9478#L17-1 assume !(main_~up~0 == 1); 9476#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 9473#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9469#L26-1 [2018-11-10 03:40:01,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1374755988, now seen corresponding path program 8 times [2018-11-10 03:40:01,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 12 times [2018-11-10 03:40:01,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -688344132, now seen corresponding path program 8 times [2018-11-10 03:40:01,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 124 proven. 418 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:01,460 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:01,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:40:01,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:40:01,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:01,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 124 proven. 418 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:01,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 03:40:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:40:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:40:01,559 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. cyclomatic complexity: 17 Second operand 14 states. [2018-11-10 03:40:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:01,702 INFO L93 Difference]: Finished difference Result 601 states and 631 transitions. [2018-11-10 03:40:01,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 03:40:01,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 631 transitions. [2018-11-10 03:40:01,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:01,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 598 states and 628 transitions. [2018-11-10 03:40:01,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:01,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:01,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 628 transitions. [2018-11-10 03:40:01,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:01,706 INFO L705 BuchiCegarLoop]: Abstraction has 598 states and 628 transitions. [2018-11-10 03:40:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 628 transitions. [2018-11-10 03:40:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 174. [2018-11-10 03:40:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-10 03:40:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-11-10 03:40:01,710 INFO L728 BuchiCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-11-10 03:40:01,710 INFO L608 BuchiCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-11-10 03:40:01,710 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 03:40:01,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 187 transitions. [2018-11-10 03:40:01,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:01,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:01,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:01,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 12, 12, 1, 1] [2018-11-10 03:40:01,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:01,712 INFO L793 eck$LassoCheckResult]: Stem: 10510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 10505#L26-1 assume true; 10579#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10573#L14 assume !(main_~i~0 == 0); 10574#L14-2 assume !(main_~i~0 == main_~range~0); 10540#L17-1 assume !(main_~up~0 == 1); 10538#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10533#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10534#L26-1 assume true; 10676#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10675#L14 assume !(main_~i~0 == 0); 10674#L14-2 assume !(main_~i~0 == main_~range~0); 10672#L17-1 assume !(main_~up~0 == 1); 10670#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10668#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10666#L26-1 assume true; 10661#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10658#L14 assume !(main_~i~0 == 0); 10655#L14-2 assume !(main_~i~0 == main_~range~0); 10652#L17-1 assume !(main_~up~0 == 1); 10649#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10646#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10647#L26-1 assume true; 10662#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10659#L14 assume !(main_~i~0 == 0); 10656#L14-2 assume !(main_~i~0 == main_~range~0); 10653#L17-1 assume !(main_~up~0 == 1); 10650#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10638#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10637#L26-1 assume true; 10636#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10635#L14 assume !(main_~i~0 == 0); 10634#L14-2 assume !(main_~i~0 == main_~range~0); 10633#L17-1 assume !(main_~up~0 == 1); 10632#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10631#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10630#L26-1 assume true; 10629#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10628#L14 assume !(main_~i~0 == 0); 10627#L14-2 assume !(main_~i~0 == main_~range~0); 10626#L17-1 assume !(main_~up~0 == 1); 10625#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10624#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10623#L26-1 assume true; 10622#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10621#L14 assume !(main_~i~0 == 0); 10620#L14-2 assume !(main_~i~0 == main_~range~0); 10619#L17-1 assume !(main_~up~0 == 1); 10618#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10617#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10616#L26-1 assume true; 10615#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10614#L14 assume !(main_~i~0 == 0); 10613#L14-2 assume !(main_~i~0 == main_~range~0); 10612#L17-1 assume !(main_~up~0 == 1); 10611#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10610#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10609#L26-1 assume true; 10608#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10607#L14 assume !(main_~i~0 == 0); 10606#L14-2 assume !(main_~i~0 == main_~range~0); 10605#L17-1 assume !(main_~up~0 == 1); 10604#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10603#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10602#L26-1 assume true; 10601#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10600#L14 assume !(main_~i~0 == 0); 10599#L14-2 assume !(main_~i~0 == main_~range~0); 10598#L17-1 assume !(main_~up~0 == 1); 10597#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10596#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10595#L26-1 assume true; 10594#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10593#L14 assume !(main_~i~0 == 0); 10592#L14-2 assume !(main_~i~0 == main_~range~0); 10591#L17-1 assume !(main_~up~0 == 1); 10590#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10585#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10551#L26-1 assume true; 10584#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10583#L14 assume !(main_~i~0 == 0); 10582#L14-2 assume !(main_~i~0 == main_~range~0); 10580#L17-1 assume !(main_~up~0 == 1); 10581#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10550#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10548#L26-1 [2018-11-10 03:40:01,712 INFO L795 eck$LassoCheckResult]: Loop: 10548#L26-1 assume true; 10518#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10519#L14 assume main_~i~0 == 0;main_~up~0 := 1; 10531#L14-2 assume !(main_~i~0 == main_~range~0); 10532#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10567#L20-1 assume !(main_~up~0 == 0); 10566#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10564#L26-1 assume true; 10562#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10560#L14 assume !(main_~i~0 == 0); 10558#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 10557#L17-1 assume !(main_~up~0 == 1); 10555#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 10552#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10548#L26-1 [2018-11-10 03:40:01,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash -824224509, now seen corresponding path program 9 times [2018-11-10 03:40:01,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 13 times [2018-11-10 03:40:01,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:01,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 281542123, now seen corresponding path program 9 times [2018-11-10 03:40:01,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 135 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:01,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:40:01,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-10 03:40:01,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:01,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 135 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:01,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:01,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-10 03:40:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:40:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:40:01,911 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. cyclomatic complexity: 18 Second operand 15 states. [2018-11-10 03:40:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:02,073 INFO L93 Difference]: Finished difference Result 622 states and 654 transitions. [2018-11-10 03:40:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 03:40:02,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 622 states and 654 transitions. [2018-11-10 03:40:02,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:02,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 622 states to 619 states and 651 transitions. [2018-11-10 03:40:02,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:02,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:02,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 619 states and 651 transitions. [2018-11-10 03:40:02,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:02,078 INFO L705 BuchiCegarLoop]: Abstraction has 619 states and 651 transitions. [2018-11-10 03:40:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states and 651 transitions. [2018-11-10 03:40:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 188. [2018-11-10 03:40:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 03:40:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2018-11-10 03:40:02,083 INFO L728 BuchiCegarLoop]: Abstraction has 188 states and 202 transitions. [2018-11-10 03:40:02,083 INFO L608 BuchiCegarLoop]: Abstraction has 188 states and 202 transitions. [2018-11-10 03:40:02,083 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 03:40:02,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 202 transitions. [2018-11-10 03:40:02,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:02,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:02,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:02,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 13, 13, 13, 13, 13, 1, 1] [2018-11-10 03:40:02,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:02,084 INFO L793 eck$LassoCheckResult]: Stem: 11647#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11642#L26-1 assume true; 11716#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11710#L14 assume !(main_~i~0 == 0); 11711#L14-2 assume !(main_~i~0 == main_~range~0); 11679#L17-1 assume !(main_~up~0 == 1); 11677#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11673#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11674#L26-1 assume true; 11827#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11826#L14 assume !(main_~i~0 == 0); 11825#L14-2 assume !(main_~i~0 == main_~range~0); 11823#L17-1 assume !(main_~up~0 == 1); 11821#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11819#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11817#L26-1 assume true; 11815#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11813#L14 assume !(main_~i~0 == 0); 11811#L14-2 assume !(main_~i~0 == main_~range~0); 11809#L17-1 assume !(main_~up~0 == 1); 11807#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11805#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11803#L26-1 assume true; 11798#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11795#L14 assume !(main_~i~0 == 0); 11792#L14-2 assume !(main_~i~0 == main_~range~0); 11789#L17-1 assume !(main_~up~0 == 1); 11786#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11783#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11784#L26-1 assume true; 11799#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11796#L14 assume !(main_~i~0 == 0); 11793#L14-2 assume !(main_~i~0 == main_~range~0); 11790#L17-1 assume !(main_~up~0 == 1); 11787#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11775#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11774#L26-1 assume true; 11773#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11772#L14 assume !(main_~i~0 == 0); 11771#L14-2 assume !(main_~i~0 == main_~range~0); 11770#L17-1 assume !(main_~up~0 == 1); 11769#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11768#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11767#L26-1 assume true; 11766#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11765#L14 assume !(main_~i~0 == 0); 11764#L14-2 assume !(main_~i~0 == main_~range~0); 11763#L17-1 assume !(main_~up~0 == 1); 11762#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11761#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11760#L26-1 assume true; 11759#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11758#L14 assume !(main_~i~0 == 0); 11757#L14-2 assume !(main_~i~0 == main_~range~0); 11756#L17-1 assume !(main_~up~0 == 1); 11755#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11754#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11753#L26-1 assume true; 11752#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11751#L14 assume !(main_~i~0 == 0); 11750#L14-2 assume !(main_~i~0 == main_~range~0); 11749#L17-1 assume !(main_~up~0 == 1); 11748#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11747#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11746#L26-1 assume true; 11745#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11744#L14 assume !(main_~i~0 == 0); 11743#L14-2 assume !(main_~i~0 == main_~range~0); 11742#L17-1 assume !(main_~up~0 == 1); 11741#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11740#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11739#L26-1 assume true; 11738#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11737#L14 assume !(main_~i~0 == 0); 11736#L14-2 assume !(main_~i~0 == main_~range~0); 11735#L17-1 assume !(main_~up~0 == 1); 11734#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11733#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11732#L26-1 assume true; 11731#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11730#L14 assume !(main_~i~0 == 0); 11729#L14-2 assume !(main_~i~0 == main_~range~0); 11728#L17-1 assume !(main_~up~0 == 1); 11727#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11722#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11702#L26-1 assume true; 11721#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11720#L14 assume !(main_~i~0 == 0); 11719#L14-2 assume !(main_~i~0 == main_~range~0); 11717#L17-1 assume !(main_~up~0 == 1); 11718#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11701#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11699#L26-1 [2018-11-10 03:40:02,084 INFO L795 eck$LassoCheckResult]: Loop: 11699#L26-1 assume true; 11652#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11653#L14 assume main_~i~0 == 0;main_~up~0 := 1; 11662#L14-2 assume !(main_~i~0 == main_~range~0); 11665#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 11666#L20-1 assume !(main_~up~0 == 0); 11648#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11649#L26-1 assume true; 11709#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11708#L14 assume !(main_~i~0 == 0); 11707#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11706#L17-1 assume !(main_~up~0 == 1); 11705#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 11703#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11699#L26-1 [2018-11-10 03:40:02,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash -693857868, now seen corresponding path program 10 times [2018-11-10 03:40:02,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 14 times [2018-11-10 03:40:02,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash 694726876, now seen corresponding path program 10 times [2018-11-10 03:40:02,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 146 proven. 585 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:02,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:02,208 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:40:02,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:40:02,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:02,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 146 proven. 585 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-10 03:40:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 03:40:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-11-10 03:40:02,317 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. cyclomatic complexity: 19 Second operand 16 states. [2018-11-10 03:40:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:02,491 INFO L93 Difference]: Finished difference Result 643 states and 677 transitions. [2018-11-10 03:40:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:40:02,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 643 states and 677 transitions. [2018-11-10 03:40:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:02,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 643 states to 640 states and 674 transitions. [2018-11-10 03:40:02,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:02,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 674 transitions. [2018-11-10 03:40:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:02,497 INFO L705 BuchiCegarLoop]: Abstraction has 640 states and 674 transitions. [2018-11-10 03:40:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 674 transitions. [2018-11-10 03:40:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 202. [2018-11-10 03:40:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-10 03:40:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2018-11-10 03:40:02,501 INFO L728 BuchiCegarLoop]: Abstraction has 202 states and 217 transitions. [2018-11-10 03:40:02,501 INFO L608 BuchiCegarLoop]: Abstraction has 202 states and 217 transitions. [2018-11-10 03:40:02,501 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 03:40:02,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 217 transitions. [2018-11-10 03:40:02,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:02,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:02,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:02,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 14, 14, 14, 14, 14, 1, 1] [2018-11-10 03:40:02,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:02,503 INFO L793 eck$LassoCheckResult]: Stem: 12843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12837#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 12838#L26-1 assume true; 12912#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12906#L14 assume !(main_~i~0 == 0); 12907#L14-2 assume !(main_~i~0 == main_~range~0); 12875#L17-1 assume !(main_~up~0 == 1); 12873#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12869#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12870#L26-1 assume true; 13037#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13036#L14 assume !(main_~i~0 == 0); 13035#L14-2 assume !(main_~i~0 == main_~range~0); 13033#L17-1 assume !(main_~up~0 == 1); 13031#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 13029#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13027#L26-1 assume true; 13025#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13023#L14 assume !(main_~i~0 == 0); 13021#L14-2 assume !(main_~i~0 == main_~range~0); 13019#L17-1 assume !(main_~up~0 == 1); 13017#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 13015#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13013#L26-1 assume true; 13011#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13009#L14 assume !(main_~i~0 == 0); 13007#L14-2 assume !(main_~i~0 == main_~range~0); 13005#L17-1 assume !(main_~up~0 == 1); 13003#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 13001#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12999#L26-1 assume true; 12994#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12991#L14 assume !(main_~i~0 == 0); 12988#L14-2 assume !(main_~i~0 == main_~range~0); 12985#L17-1 assume !(main_~up~0 == 1); 12982#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12979#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12980#L26-1 assume true; 12995#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12992#L14 assume !(main_~i~0 == 0); 12989#L14-2 assume !(main_~i~0 == main_~range~0); 12986#L17-1 assume !(main_~up~0 == 1); 12983#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12971#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12970#L26-1 assume true; 12969#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12968#L14 assume !(main_~i~0 == 0); 12967#L14-2 assume !(main_~i~0 == main_~range~0); 12966#L17-1 assume !(main_~up~0 == 1); 12965#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12964#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12963#L26-1 assume true; 12962#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12961#L14 assume !(main_~i~0 == 0); 12960#L14-2 assume !(main_~i~0 == main_~range~0); 12959#L17-1 assume !(main_~up~0 == 1); 12958#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12957#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12956#L26-1 assume true; 12955#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12954#L14 assume !(main_~i~0 == 0); 12953#L14-2 assume !(main_~i~0 == main_~range~0); 12952#L17-1 assume !(main_~up~0 == 1); 12951#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12950#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12949#L26-1 assume true; 12948#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12947#L14 assume !(main_~i~0 == 0); 12946#L14-2 assume !(main_~i~0 == main_~range~0); 12945#L17-1 assume !(main_~up~0 == 1); 12944#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12943#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12942#L26-1 assume true; 12941#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12940#L14 assume !(main_~i~0 == 0); 12939#L14-2 assume !(main_~i~0 == main_~range~0); 12938#L17-1 assume !(main_~up~0 == 1); 12937#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12936#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12935#L26-1 assume true; 12934#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12933#L14 assume !(main_~i~0 == 0); 12932#L14-2 assume !(main_~i~0 == main_~range~0); 12931#L17-1 assume !(main_~up~0 == 1); 12930#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12929#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12928#L26-1 assume true; 12927#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12926#L14 assume !(main_~i~0 == 0); 12925#L14-2 assume !(main_~i~0 == main_~range~0); 12924#L17-1 assume !(main_~up~0 == 1); 12923#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12918#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12898#L26-1 assume true; 12917#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12916#L14 assume !(main_~i~0 == 0); 12915#L14-2 assume !(main_~i~0 == main_~range~0); 12913#L17-1 assume !(main_~up~0 == 1); 12914#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12897#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12895#L26-1 [2018-11-10 03:40:02,503 INFO L795 eck$LassoCheckResult]: Loop: 12895#L26-1 assume true; 12848#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12849#L14 assume main_~i~0 == 0;main_~up~0 := 1; 12858#L14-2 assume !(main_~i~0 == main_~range~0); 12861#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12862#L20-1 assume !(main_~up~0 == 0); 12844#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12845#L26-1 assume true; 12905#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12904#L14 assume !(main_~i~0 == 0); 12903#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 12902#L17-1 assume !(main_~up~0 == 1); 12901#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 12899#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12895#L26-1 [2018-11-10 03:40:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash 276028387, now seen corresponding path program 11 times [2018-11-10 03:40:02,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 15 times [2018-11-10 03:40:02,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:02,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2029452491, now seen corresponding path program 11 times [2018-11-10 03:40:02,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:02,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:02,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 157 proven. 679 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:02,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:02,672 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:40:02,721 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-10 03:40:02,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:02,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 157 proven. 679 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-11-10 03:40:02,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:40:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:40:02,859 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. cyclomatic complexity: 20 Second operand 25 states. [2018-11-10 03:40:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:03,269 INFO L93 Difference]: Finished difference Result 655 states and 691 transitions. [2018-11-10 03:40:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 03:40:03,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 655 states and 691 transitions. [2018-11-10 03:40:03,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:03,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 655 states to 640 states and 676 transitions. [2018-11-10 03:40:03,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:03,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:03,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 676 transitions. [2018-11-10 03:40:03,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:03,272 INFO L705 BuchiCegarLoop]: Abstraction has 640 states and 676 transitions. [2018-11-10 03:40:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 676 transitions. [2018-11-10 03:40:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 188. [2018-11-10 03:40:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 03:40:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-11-10 03:40:03,277 INFO L728 BuchiCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-11-10 03:40:03,277 INFO L608 BuchiCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-11-10 03:40:03,277 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 03:40:03,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 200 transitions. [2018-11-10 03:40:03,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:03,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:03,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:03,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 15, 15, 15, 1, 1] [2018-11-10 03:40:03,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:03,279 INFO L793 eck$LassoCheckResult]: Stem: 14149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 14148#L26-1 assume true; 14222#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14207#L14 assume !(main_~i~0 == 0); 14208#L14-2 assume !(main_~i~0 == main_~range~0); 14188#L17-1 assume !(main_~up~0 == 1); 14186#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14182#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14183#L26-1 assume true; 14327#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14326#L14 assume !(main_~i~0 == 0); 14325#L14-2 assume !(main_~i~0 == main_~range~0); 14324#L17-1 assume !(main_~up~0 == 1); 14323#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14317#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14316#L26-1 assume true; 14315#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14314#L14 assume !(main_~i~0 == 0); 14313#L14-2 assume !(main_~i~0 == main_~range~0); 14312#L17-1 assume !(main_~up~0 == 1); 14311#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14310#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14309#L26-1 assume true; 14308#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14307#L14 assume !(main_~i~0 == 0); 14306#L14-2 assume !(main_~i~0 == main_~range~0); 14305#L17-1 assume !(main_~up~0 == 1); 14304#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14303#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14302#L26-1 assume true; 14301#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14300#L14 assume !(main_~i~0 == 0); 14299#L14-2 assume !(main_~i~0 == main_~range~0); 14298#L17-1 assume !(main_~up~0 == 1); 14297#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14296#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14295#L26-1 assume true; 14294#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14293#L14 assume !(main_~i~0 == 0); 14292#L14-2 assume !(main_~i~0 == main_~range~0); 14291#L17-1 assume !(main_~up~0 == 1); 14290#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14289#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14288#L26-1 assume true; 14287#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14286#L14 assume !(main_~i~0 == 0); 14285#L14-2 assume !(main_~i~0 == main_~range~0); 14284#L17-1 assume !(main_~up~0 == 1); 14283#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14282#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14281#L26-1 assume true; 14280#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14279#L14 assume !(main_~i~0 == 0); 14278#L14-2 assume !(main_~i~0 == main_~range~0); 14277#L17-1 assume !(main_~up~0 == 1); 14276#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14275#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14274#L26-1 assume true; 14273#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14272#L14 assume !(main_~i~0 == 0); 14271#L14-2 assume !(main_~i~0 == main_~range~0); 14270#L17-1 assume !(main_~up~0 == 1); 14269#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14268#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14267#L26-1 assume true; 14266#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14265#L14 assume !(main_~i~0 == 0); 14264#L14-2 assume !(main_~i~0 == main_~range~0); 14263#L17-1 assume !(main_~up~0 == 1); 14262#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14261#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14260#L26-1 assume true; 14259#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14258#L14 assume !(main_~i~0 == 0); 14257#L14-2 assume !(main_~i~0 == main_~range~0); 14256#L17-1 assume !(main_~up~0 == 1); 14255#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14254#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14253#L26-1 assume true; 14252#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14251#L14 assume !(main_~i~0 == 0); 14250#L14-2 assume !(main_~i~0 == main_~range~0); 14249#L17-1 assume !(main_~up~0 == 1); 14248#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14247#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14246#L26-1 assume true; 14245#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14244#L14 assume !(main_~i~0 == 0); 14243#L14-2 assume !(main_~i~0 == main_~range~0); 14242#L17-1 assume !(main_~up~0 == 1); 14241#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14240#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14239#L26-1 assume true; 14237#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14235#L14 assume !(main_~i~0 == 0); 14233#L14-2 assume !(main_~i~0 == main_~range~0); 14231#L17-1 assume !(main_~up~0 == 1); 14230#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14229#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14212#L26-1 assume true; 14228#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14227#L14 assume !(main_~i~0 == 0); 14226#L14-2 assume !(main_~i~0 == main_~range~0); 14224#L17-1 assume !(main_~up~0 == 1); 14225#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14211#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 14210#L26-1 [2018-11-10 03:40:03,279 INFO L795 eck$LassoCheckResult]: Loop: 14210#L26-1 assume true; 14209#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14168#L14 assume main_~i~0 == 0;main_~up~0 := 1; 14169#L14-2 assume !(main_~i~0 == main_~range~0); 14174#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 14175#L20-1 assume !(main_~up~0 == 0); 14154#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 14155#L26-1 assume true; 14219#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14218#L14 assume !(main_~i~0 == 0); 14217#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 14216#L17-1 assume !(main_~up~0 == 1); 14215#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 14213#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 14210#L26-1 [2018-11-10 03:40:03,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash 689213140, now seen corresponding path program 12 times [2018-11-10 03:40:03,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:03,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 16 times [2018-11-10 03:40:03,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:03,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash 554120700, now seen corresponding path program 12 times [2018-11-10 03:40:03,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:03,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 168 proven. 780 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:03,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:03,446 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:03,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 03:40:03,493 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-10 03:40:03,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:03,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 168 proven. 780 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-11-10 03:40:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 03:40:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2018-11-10 03:40:03,630 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. cyclomatic complexity: 17 Second operand 26 states. [2018-11-10 03:40:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:04,202 INFO L93 Difference]: Finished difference Result 398 states and 436 transitions. [2018-11-10 03:40:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 03:40:04,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 436 transitions. [2018-11-10 03:40:04,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:04,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 395 states and 433 transitions. [2018-11-10 03:40:04,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:04,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:04,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 433 transitions. [2018-11-10 03:40:04,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:04,205 INFO L705 BuchiCegarLoop]: Abstraction has 395 states and 433 transitions. [2018-11-10 03:40:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 433 transitions. [2018-11-10 03:40:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 195. [2018-11-10 03:40:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-10 03:40:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2018-11-10 03:40:04,208 INFO L728 BuchiCegarLoop]: Abstraction has 195 states and 207 transitions. [2018-11-10 03:40:04,209 INFO L608 BuchiCegarLoop]: Abstraction has 195 states and 207 transitions. [2018-11-10 03:40:04,209 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-10 03:40:04,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 207 transitions. [2018-11-10 03:40:04,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:04,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:04,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:04,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 16, 16, 16, 16, 16, 1, 1] [2018-11-10 03:40:04,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:04,210 INFO L793 eck$LassoCheckResult]: Stem: 15214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 15213#L26-1 assume true; 15287#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15270#L14 assume !(main_~i~0 == 0); 15271#L14-2 assume !(main_~i~0 == main_~range~0); 15251#L17-1 assume !(main_~up~0 == 1); 15249#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15245#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15246#L26-1 assume true; 15406#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15404#L14 assume !(main_~i~0 == 0); 15402#L14-2 assume !(main_~i~0 == main_~range~0); 15400#L17-1 assume !(main_~up~0 == 1); 15398#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15388#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15387#L26-1 assume true; 15386#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15385#L14 assume !(main_~i~0 == 0); 15384#L14-2 assume !(main_~i~0 == main_~range~0); 15383#L17-1 assume !(main_~up~0 == 1); 15382#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15381#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15380#L26-1 assume true; 15379#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15378#L14 assume !(main_~i~0 == 0); 15377#L14-2 assume !(main_~i~0 == main_~range~0); 15376#L17-1 assume !(main_~up~0 == 1); 15375#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15374#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15373#L26-1 assume true; 15372#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15371#L14 assume !(main_~i~0 == 0); 15370#L14-2 assume !(main_~i~0 == main_~range~0); 15369#L17-1 assume !(main_~up~0 == 1); 15368#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15367#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15366#L26-1 assume true; 15365#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15364#L14 assume !(main_~i~0 == 0); 15363#L14-2 assume !(main_~i~0 == main_~range~0); 15362#L17-1 assume !(main_~up~0 == 1); 15361#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15360#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15359#L26-1 assume true; 15358#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15357#L14 assume !(main_~i~0 == 0); 15356#L14-2 assume !(main_~i~0 == main_~range~0); 15355#L17-1 assume !(main_~up~0 == 1); 15354#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15353#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15352#L26-1 assume true; 15351#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15350#L14 assume !(main_~i~0 == 0); 15349#L14-2 assume !(main_~i~0 == main_~range~0); 15348#L17-1 assume !(main_~up~0 == 1); 15347#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15346#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15345#L26-1 assume true; 15344#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15343#L14 assume !(main_~i~0 == 0); 15342#L14-2 assume !(main_~i~0 == main_~range~0); 15341#L17-1 assume !(main_~up~0 == 1); 15340#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15339#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15338#L26-1 assume true; 15337#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15336#L14 assume !(main_~i~0 == 0); 15335#L14-2 assume !(main_~i~0 == main_~range~0); 15334#L17-1 assume !(main_~up~0 == 1); 15333#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15332#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15331#L26-1 assume true; 15330#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15329#L14 assume !(main_~i~0 == 0); 15328#L14-2 assume !(main_~i~0 == main_~range~0); 15327#L17-1 assume !(main_~up~0 == 1); 15326#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15325#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15324#L26-1 assume true; 15323#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15322#L14 assume !(main_~i~0 == 0); 15321#L14-2 assume !(main_~i~0 == main_~range~0); 15320#L17-1 assume !(main_~up~0 == 1); 15319#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15318#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15317#L26-1 assume true; 15316#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15315#L14 assume !(main_~i~0 == 0); 15314#L14-2 assume !(main_~i~0 == main_~range~0); 15313#L17-1 assume !(main_~up~0 == 1); 15312#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15311#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15310#L26-1 assume true; 15309#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15308#L14 assume !(main_~i~0 == 0); 15307#L14-2 assume !(main_~i~0 == main_~range~0); 15306#L17-1 assume !(main_~up~0 == 1); 15305#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15304#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15303#L26-1 assume true; 15301#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15299#L14 assume !(main_~i~0 == 0); 15297#L14-2 assume !(main_~i~0 == main_~range~0); 15295#L17-1 assume !(main_~up~0 == 1); 15294#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15293#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15275#L26-1 assume true; 15292#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15291#L14 assume !(main_~i~0 == 0); 15290#L14-2 assume !(main_~i~0 == main_~range~0); 15288#L17-1 assume !(main_~up~0 == 1); 15289#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15274#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 15273#L26-1 [2018-11-10 03:40:04,211 INFO L795 eck$LassoCheckResult]: Loop: 15273#L26-1 assume true; 15272#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15233#L14 assume main_~i~0 == 0;main_~up~0 := 1; 15234#L14-2 assume !(main_~i~0 == main_~range~0); 15237#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 15238#L20-1 assume !(main_~up~0 == 0); 15219#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 15220#L26-1 assume true; 15282#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15281#L14 assume !(main_~i~0 == 0); 15280#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 15279#L17-1 assume !(main_~up~0 == 1); 15278#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 15276#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 15273#L26-1 [2018-11-10 03:40:04,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2023938755, now seen corresponding path program 13 times [2018-11-10 03:40:04,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 17 times [2018-11-10 03:40:04,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1276015531, now seen corresponding path program 13 times [2018-11-10 03:40:04,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 179 proven. 888 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:04,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:04,396 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:04,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:04,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 179 proven. 888 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:04,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:04,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-10 03:40:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 03:40:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:40:04,518 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. cyclomatic complexity: 17 Second operand 19 states. [2018-11-10 03:40:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:04,754 INFO L93 Difference]: Finished difference Result 1225 states and 1265 transitions. [2018-11-10 03:40:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 03:40:04,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1265 transitions. [2018-11-10 03:40:04,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:04,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1222 states and 1262 transitions. [2018-11-10 03:40:04,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:04,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:04,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1222 states and 1262 transitions. [2018-11-10 03:40:04,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:04,762 INFO L705 BuchiCegarLoop]: Abstraction has 1222 states and 1262 transitions. [2018-11-10 03:40:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states and 1262 transitions. [2018-11-10 03:40:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 202. [2018-11-10 03:40:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-10 03:40:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2018-11-10 03:40:04,767 INFO L728 BuchiCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-11-10 03:40:04,767 INFO L608 BuchiCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-11-10 03:40:04,767 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-10 03:40:04,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 214 transitions. [2018-11-10 03:40:04,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:04,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:04,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:04,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 17, 17, 17, 17, 17, 1, 1] [2018-11-10 03:40:04,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:04,769 INFO L793 eck$LassoCheckResult]: Stem: 17075#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 17070#L26-1 assume true; 17143#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17137#L14 assume !(main_~i~0 == 0); 17138#L14-2 assume !(main_~i~0 == main_~range~0); 17106#L17-1 assume !(main_~up~0 == 1); 17104#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17100#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17101#L26-1 assume true; 17267#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17264#L14 assume !(main_~i~0 == 0); 17261#L14-2 assume !(main_~i~0 == main_~range~0); 17258#L17-1 assume !(main_~up~0 == 1); 17255#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17252#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17253#L26-1 assume true; 17268#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17265#L14 assume !(main_~i~0 == 0); 17262#L14-2 assume !(main_~i~0 == main_~range~0); 17259#L17-1 assume !(main_~up~0 == 1); 17256#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17244#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17243#L26-1 assume true; 17242#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17241#L14 assume !(main_~i~0 == 0); 17240#L14-2 assume !(main_~i~0 == main_~range~0); 17239#L17-1 assume !(main_~up~0 == 1); 17238#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17237#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17236#L26-1 assume true; 17235#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17234#L14 assume !(main_~i~0 == 0); 17233#L14-2 assume !(main_~i~0 == main_~range~0); 17232#L17-1 assume !(main_~up~0 == 1); 17231#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17230#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17229#L26-1 assume true; 17228#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17227#L14 assume !(main_~i~0 == 0); 17226#L14-2 assume !(main_~i~0 == main_~range~0); 17225#L17-1 assume !(main_~up~0 == 1); 17224#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17223#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17222#L26-1 assume true; 17221#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17220#L14 assume !(main_~i~0 == 0); 17219#L14-2 assume !(main_~i~0 == main_~range~0); 17218#L17-1 assume !(main_~up~0 == 1); 17217#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17216#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17215#L26-1 assume true; 17214#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17213#L14 assume !(main_~i~0 == 0); 17212#L14-2 assume !(main_~i~0 == main_~range~0); 17211#L17-1 assume !(main_~up~0 == 1); 17210#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17209#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17208#L26-1 assume true; 17207#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17206#L14 assume !(main_~i~0 == 0); 17205#L14-2 assume !(main_~i~0 == main_~range~0); 17204#L17-1 assume !(main_~up~0 == 1); 17203#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17202#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17201#L26-1 assume true; 17200#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17199#L14 assume !(main_~i~0 == 0); 17198#L14-2 assume !(main_~i~0 == main_~range~0); 17197#L17-1 assume !(main_~up~0 == 1); 17196#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17195#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17194#L26-1 assume true; 17193#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17192#L14 assume !(main_~i~0 == 0); 17191#L14-2 assume !(main_~i~0 == main_~range~0); 17190#L17-1 assume !(main_~up~0 == 1); 17189#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17188#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17187#L26-1 assume true; 17186#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17185#L14 assume !(main_~i~0 == 0); 17184#L14-2 assume !(main_~i~0 == main_~range~0); 17183#L17-1 assume !(main_~up~0 == 1); 17182#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17181#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17180#L26-1 assume true; 17179#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17178#L14 assume !(main_~i~0 == 0); 17177#L14-2 assume !(main_~i~0 == main_~range~0); 17176#L17-1 assume !(main_~up~0 == 1); 17175#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17174#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17173#L26-1 assume true; 17172#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17171#L14 assume !(main_~i~0 == 0); 17170#L14-2 assume !(main_~i~0 == main_~range~0); 17169#L17-1 assume !(main_~up~0 == 1); 17168#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17167#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17166#L26-1 assume true; 17165#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17164#L14 assume !(main_~i~0 == 0); 17163#L14-2 assume !(main_~i~0 == main_~range~0); 17162#L17-1 assume !(main_~up~0 == 1); 17161#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17160#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17159#L26-1 assume true; 17158#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17157#L14 assume !(main_~i~0 == 0); 17156#L14-2 assume !(main_~i~0 == main_~range~0); 17155#L17-1 assume !(main_~up~0 == 1); 17154#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17149#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17129#L26-1 assume true; 17148#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17147#L14 assume !(main_~i~0 == 0); 17146#L14-2 assume !(main_~i~0 == main_~range~0); 17144#L17-1 assume !(main_~up~0 == 1); 17145#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17128#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 17126#L26-1 [2018-11-10 03:40:04,769 INFO L795 eck$LassoCheckResult]: Loop: 17126#L26-1 assume true; 17080#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17081#L14 assume main_~i~0 == 0;main_~up~0 := 1; 17089#L14-2 assume !(main_~i~0 == main_~range~0); 17092#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 17093#L20-1 assume !(main_~up~0 == 0); 17076#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 17077#L26-1 assume true; 17136#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17135#L14 assume !(main_~i~0 == 0); 17134#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 17133#L17-1 assume !(main_~up~0 == 1); 17132#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 17130#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 17126#L26-1 [2018-11-10 03:40:04,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 548606964, now seen corresponding path program 14 times [2018-11-10 03:40:04,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 18 times [2018-11-10 03:40:04,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1513733348, now seen corresponding path program 14 times [2018-11-10 03:40:04,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:04,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 190 proven. 1003 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:04,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:04,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:04,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:40:04,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:40:04,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:04,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 190 proven. 1003 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-10 03:40:05,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 03:40:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:40:05,012 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. cyclomatic complexity: 17 Second operand 20 states. [2018-11-10 03:40:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:05,222 INFO L93 Difference]: Finished difference Result 1246 states and 1288 transitions. [2018-11-10 03:40:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 03:40:05,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1246 states and 1288 transitions. [2018-11-10 03:40:05,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:05,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1246 states to 1243 states and 1285 transitions. [2018-11-10 03:40:05,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:05,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:05,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1243 states and 1285 transitions. [2018-11-10 03:40:05,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:05,227 INFO L705 BuchiCegarLoop]: Abstraction has 1243 states and 1285 transitions. [2018-11-10 03:40:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states and 1285 transitions. [2018-11-10 03:40:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 216. [2018-11-10 03:40:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-10 03:40:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 229 transitions. [2018-11-10 03:40:05,232 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 229 transitions. [2018-11-10 03:40:05,232 INFO L608 BuchiCegarLoop]: Abstraction has 216 states and 229 transitions. [2018-11-10 03:40:05,232 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-10 03:40:05,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 229 transitions. [2018-11-10 03:40:05,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:05,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:05,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:05,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 18, 18, 18, 18, 18, 1, 1] [2018-11-10 03:40:05,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:05,234 INFO L793 eck$LassoCheckResult]: Stem: 18984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 18979#L26-1 assume true; 19053#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19047#L14 assume !(main_~i~0 == 0); 19048#L14-2 assume !(main_~i~0 == main_~range~0); 19014#L17-1 assume !(main_~up~0 == 1); 19012#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19007#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19008#L26-1 assume true; 19192#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19191#L14 assume !(main_~i~0 == 0); 19190#L14-2 assume !(main_~i~0 == main_~range~0); 19188#L17-1 assume !(main_~up~0 == 1); 19186#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19184#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19182#L26-1 assume true; 19177#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19174#L14 assume !(main_~i~0 == 0); 19171#L14-2 assume !(main_~i~0 == main_~range~0); 19168#L17-1 assume !(main_~up~0 == 1); 19165#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19162#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19163#L26-1 assume true; 19178#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19175#L14 assume !(main_~i~0 == 0); 19172#L14-2 assume !(main_~i~0 == main_~range~0); 19169#L17-1 assume !(main_~up~0 == 1); 19166#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19154#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19153#L26-1 assume true; 19152#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19151#L14 assume !(main_~i~0 == 0); 19150#L14-2 assume !(main_~i~0 == main_~range~0); 19149#L17-1 assume !(main_~up~0 == 1); 19148#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19147#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19146#L26-1 assume true; 19145#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19144#L14 assume !(main_~i~0 == 0); 19143#L14-2 assume !(main_~i~0 == main_~range~0); 19142#L17-1 assume !(main_~up~0 == 1); 19141#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19140#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19139#L26-1 assume true; 19138#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19137#L14 assume !(main_~i~0 == 0); 19136#L14-2 assume !(main_~i~0 == main_~range~0); 19135#L17-1 assume !(main_~up~0 == 1); 19134#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19133#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19132#L26-1 assume true; 19131#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19130#L14 assume !(main_~i~0 == 0); 19129#L14-2 assume !(main_~i~0 == main_~range~0); 19128#L17-1 assume !(main_~up~0 == 1); 19127#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19126#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19125#L26-1 assume true; 19124#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19123#L14 assume !(main_~i~0 == 0); 19122#L14-2 assume !(main_~i~0 == main_~range~0); 19121#L17-1 assume !(main_~up~0 == 1); 19120#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19119#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19118#L26-1 assume true; 19117#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19116#L14 assume !(main_~i~0 == 0); 19115#L14-2 assume !(main_~i~0 == main_~range~0); 19114#L17-1 assume !(main_~up~0 == 1); 19113#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19112#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19111#L26-1 assume true; 19110#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19109#L14 assume !(main_~i~0 == 0); 19108#L14-2 assume !(main_~i~0 == main_~range~0); 19107#L17-1 assume !(main_~up~0 == 1); 19106#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19105#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19104#L26-1 assume true; 19103#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19102#L14 assume !(main_~i~0 == 0); 19101#L14-2 assume !(main_~i~0 == main_~range~0); 19100#L17-1 assume !(main_~up~0 == 1); 19099#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19098#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19097#L26-1 assume true; 19096#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19095#L14 assume !(main_~i~0 == 0); 19094#L14-2 assume !(main_~i~0 == main_~range~0); 19093#L17-1 assume !(main_~up~0 == 1); 19092#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19091#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19090#L26-1 assume true; 19089#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19088#L14 assume !(main_~i~0 == 0); 19087#L14-2 assume !(main_~i~0 == main_~range~0); 19086#L17-1 assume !(main_~up~0 == 1); 19085#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19084#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19083#L26-1 assume true; 19082#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19081#L14 assume !(main_~i~0 == 0); 19080#L14-2 assume !(main_~i~0 == main_~range~0); 19079#L17-1 assume !(main_~up~0 == 1); 19078#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19077#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19076#L26-1 assume true; 19075#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19074#L14 assume !(main_~i~0 == 0); 19073#L14-2 assume !(main_~i~0 == main_~range~0); 19072#L17-1 assume !(main_~up~0 == 1); 19071#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19070#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19069#L26-1 assume true; 19068#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19067#L14 assume !(main_~i~0 == 0); 19066#L14-2 assume !(main_~i~0 == main_~range~0); 19065#L17-1 assume !(main_~up~0 == 1); 19064#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19059#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19025#L26-1 assume true; 19058#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19057#L14 assume !(main_~i~0 == 0); 19056#L14-2 assume !(main_~i~0 == main_~range~0); 19054#L17-1 assume !(main_~up~0 == 1); 19055#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19024#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 19022#L26-1 [2018-11-10 03:40:05,234 INFO L795 eck$LassoCheckResult]: Loop: 19022#L26-1 assume true; 18992#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18993#L14 assume main_~i~0 == 0;main_~up~0 := 1; 19005#L14-2 assume !(main_~i~0 == main_~range~0); 19006#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19041#L20-1 assume !(main_~up~0 == 0); 19040#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 19038#L26-1 assume true; 19036#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19034#L14 assume !(main_~i~0 == 0); 19032#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 19031#L17-1 assume !(main_~up~0 == 1); 19029#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 19026#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 19022#L26-1 [2018-11-10 03:40:05,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1270501795, now seen corresponding path program 15 times [2018-11-10 03:40:05,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 19 times [2018-11-10 03:40:05,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 769417867, now seen corresponding path program 15 times [2018-11-10 03:40:05,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:05,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:40:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 201 proven. 1125 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:05,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:05,419 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/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-11-10 03:40:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:40:05,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-10 03:40:05,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:40:05,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 201 proven. 1125 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:40:05,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:05,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-10 03:40:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 03:40:05,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:40:05,518 INFO L87 Difference]: Start difference. First operand 216 states and 229 transitions. cyclomatic complexity: 18 Second operand 21 states. [2018-11-10 03:40:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:40:05,780 INFO L93 Difference]: Finished difference Result 1267 states and 1311 transitions. [2018-11-10 03:40:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 03:40:05,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1267 states and 1311 transitions. [2018-11-10 03:40:05,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:05,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1267 states to 1264 states and 1308 transitions. [2018-11-10 03:40:05,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:40:05,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:40:05,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1264 states and 1308 transitions. [2018-11-10 03:40:05,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:40:05,785 INFO L705 BuchiCegarLoop]: Abstraction has 1264 states and 1308 transitions. [2018-11-10 03:40:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states and 1308 transitions. [2018-11-10 03:40:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 230. [2018-11-10 03:40:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 03:40:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 244 transitions. [2018-11-10 03:40:05,788 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 244 transitions. [2018-11-10 03:40:05,788 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 244 transitions. [2018-11-10 03:40:05,788 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-10 03:40:05,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 244 transitions. [2018-11-10 03:40:05,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 03:40:05,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:40:05,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:40:05,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 19, 19, 19, 19, 19, 1, 1] [2018-11-10 03:40:05,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:40:05,790 INFO L793 eck$LassoCheckResult]: Stem: 20952#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 20947#L26-1 assume true; 21021#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21015#L14 assume !(main_~i~0 == 0); 21016#L14-2 assume !(main_~i~0 == main_~range~0); 20982#L17-1 assume !(main_~up~0 == 1); 20980#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 20975#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 20976#L26-1 assume true; 21174#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21173#L14 assume !(main_~i~0 == 0); 21172#L14-2 assume !(main_~i~0 == main_~range~0); 21170#L17-1 assume !(main_~up~0 == 1); 21168#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21166#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21164#L26-1 assume true; 21162#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21160#L14 assume !(main_~i~0 == 0); 21158#L14-2 assume !(main_~i~0 == main_~range~0); 21156#L17-1 assume !(main_~up~0 == 1); 21154#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21152#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21150#L26-1 assume true; 21145#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21142#L14 assume !(main_~i~0 == 0); 21139#L14-2 assume !(main_~i~0 == main_~range~0); 21136#L17-1 assume !(main_~up~0 == 1); 21133#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21130#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21131#L26-1 assume true; 21146#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21143#L14 assume !(main_~i~0 == 0); 21140#L14-2 assume !(main_~i~0 == main_~range~0); 21137#L17-1 assume !(main_~up~0 == 1); 21134#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21122#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21121#L26-1 assume true; 21120#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21119#L14 assume !(main_~i~0 == 0); 21118#L14-2 assume !(main_~i~0 == main_~range~0); 21117#L17-1 assume !(main_~up~0 == 1); 21116#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21115#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21114#L26-1 assume true; 21113#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21112#L14 assume !(main_~i~0 == 0); 21111#L14-2 assume !(main_~i~0 == main_~range~0); 21110#L17-1 assume !(main_~up~0 == 1); 21109#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21108#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21107#L26-1 assume true; 21106#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21105#L14 assume !(main_~i~0 == 0); 21104#L14-2 assume !(main_~i~0 == main_~range~0); 21103#L17-1 assume !(main_~up~0 == 1); 21102#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21101#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21100#L26-1 assume true; 21099#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21098#L14 assume !(main_~i~0 == 0); 21097#L14-2 assume !(main_~i~0 == main_~range~0); 21096#L17-1 assume !(main_~up~0 == 1); 21095#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21094#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21093#L26-1 assume true; 21092#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21091#L14 assume !(main_~i~0 == 0); 21090#L14-2 assume !(main_~i~0 == main_~range~0); 21089#L17-1 assume !(main_~up~0 == 1); 21088#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21087#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21086#L26-1 assume true; 21085#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21084#L14 assume !(main_~i~0 == 0); 21083#L14-2 assume !(main_~i~0 == main_~range~0); 21082#L17-1 assume !(main_~up~0 == 1); 21081#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21080#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21079#L26-1 assume true; 21078#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21077#L14 assume !(main_~i~0 == 0); 21076#L14-2 assume !(main_~i~0 == main_~range~0); 21075#L17-1 assume !(main_~up~0 == 1); 21074#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21073#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21072#L26-1 assume true; 21071#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21070#L14 assume !(main_~i~0 == 0); 21069#L14-2 assume !(main_~i~0 == main_~range~0); 21068#L17-1 assume !(main_~up~0 == 1); 21067#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21066#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21065#L26-1 assume true; 21064#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21063#L14 assume !(main_~i~0 == 0); 21062#L14-2 assume !(main_~i~0 == main_~range~0); 21061#L17-1 assume !(main_~up~0 == 1); 21060#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21059#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21058#L26-1 assume true; 21057#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21056#L14 assume !(main_~i~0 == 0); 21055#L14-2 assume !(main_~i~0 == main_~range~0); 21054#L17-1 assume !(main_~up~0 == 1); 21053#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21052#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21051#L26-1 assume true; 21050#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21049#L14 assume !(main_~i~0 == 0); 21048#L14-2 assume !(main_~i~0 == main_~range~0); 21047#L17-1 assume !(main_~up~0 == 1); 21046#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21045#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21044#L26-1 assume true; 21043#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21042#L14 assume !(main_~i~0 == 0); 21041#L14-2 assume !(main_~i~0 == main_~range~0); 21040#L17-1 assume !(main_~up~0 == 1); 21039#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21038#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 21037#L26-1 assume true; 21036#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21035#L14 assume !(main_~i~0 == 0); 21034#L14-2 assume !(main_~i~0 == main_~range~0); 21033#L17-1 assume !(main_~up~0 == 1); 21032#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 21027#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 20993#L26-1 assume true; 21026#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21025#L14 assume !(main_~i~0 == 0); 21024#L14-2 assume !(main_~i~0 == main_~range~0); 21022#L17-1 assume !(main_~up~0 == 1); 21023#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 20992#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 20990#L26-1 [2018-11-10 03:40:05,790 INFO L795 eck$LassoCheckResult]: Loop: 20990#L26-1 assume true; 20960#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 20961#L14 assume main_~i~0 == 0;main_~up~0 := 1; 20973#L14-2 assume !(main_~i~0 == main_~range~0); 20974#L17-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 21009#L20-1 assume !(main_~up~0 == 0); 21008#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 21006#L26-1 assume true; 21004#L13-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21002#L14 assume !(main_~i~0 == 0); 21000#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 20999#L17-1 assume !(main_~up~0 == 1); 20997#L20-1 assume main_~up~0 == 0;main_~i~0 := main_~i~0 - 1; 20994#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 20990#L26-1 [2018-11-10 03:40:05,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1519247084, now seen corresponding path program 16 times [2018-11-10 03:40:05,791 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1507158935, now seen corresponding path program 20 times [2018-11-10 03:40:05,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:40:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -803743684, now seen corresponding path program 16 times [2018-11-10 03:40:05,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:40:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:40:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:40:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:40:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:40:06,395 WARN L179 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 131 [2018-11-10 03:40:06,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:40:06 BoogieIcfgContainer [2018-11-10 03:40:06,430 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:40:06,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:40:06,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:40:06,431 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:40:06,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:39:54" (3/4) ... [2018-11-10 03:40:06,434 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 03:40:06,487 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a2a4acf-3390-404b-8c8d-73e95832880a/bin-2019/uautomizer/witness.graphml [2018-11-10 03:40:06,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:40:06,487 INFO L168 Benchmark]: Toolchain (without parser) took 11885.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -63.6 MB). Peak memory consumption was 368.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.33 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: Boogie Preprocessor took 11.01 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: RCFGBuilder took 165.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:40:06,488 INFO L168 Benchmark]: BuchiAutomizer took 11480.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.1 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:40:06,489 INFO L168 Benchmark]: Witness Printer took 56.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:40:06,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.33 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.01 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 165.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11480.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.1 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. * Witness Printer took 56.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 30 terminating modules (26 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function range + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function range + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 26 modules have a trivial ranking function, the largest among these consists of 26 locations. The remainder module has 230 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 29 iterations. TraceHistogramMax:19. Analysis of lassos took 6.9s. Construction of modules took 1.3s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 28. Automata minimization 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 6347 StatesRemovedByMinimization, 29 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 230 states and ocurred in iteration 28. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 414 SDtfs, 2061 SDslu, 1190 SDs, 0 SdLazy, 3299 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc16 concLT0 SILN3 SILU0 SILI2 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp58 dnf131 smp96 tf106 neg90 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: 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 {up=0, range=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2805dc9b=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 Loop: [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...