./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:22,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:22,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:22,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:22,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:22,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:22,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:22,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:22,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:22,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:22,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:22,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:22,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:22,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:22,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:22,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:22,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:22,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:22,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:22,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:22,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:22,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:22,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:22,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:22,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:22,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:22,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:22,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:22,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:22,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:22,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:22,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:22,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:22,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:22,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:22,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:22,595 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:12:22,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:22,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:22,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:22,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:22,613 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:22,613 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:22,613 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:22,614 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:22,614 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:22,614 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:22,614 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:22,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:22,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:22,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:22,616 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:22,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:22,617 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:22,617 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:22,617 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:22,618 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_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b [2018-10-27 06:12:22,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:22,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:22,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:22,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:22,685 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:22,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:12:22,733 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/data/6ad8dc339/da9c3ef834404aa4a3d21af4f0bd1cbe/FLAG7826bfca9 [2018-10-27 06:12:23,111 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:23,112 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:12:23,119 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/data/6ad8dc339/da9c3ef834404aa4a3d21af4f0bd1cbe/FLAG7826bfca9 [2018-10-27 06:12:23,131 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/data/6ad8dc339/da9c3ef834404aa4a3d21af4f0bd1cbe [2018-10-27 06:12:23,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:23,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:23,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:23,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:23,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:23,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14956367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23, skipping insertion in model container [2018-10-27 06:12:23,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:23,174 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:23,329 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:23,333 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:23,358 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:23,371 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:23,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23 WrapperNode [2018-10-27 06:12:23,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:23,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:23,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:23,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:23,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:23,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:23,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:23,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:23,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... [2018-10-27 06:12:23,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:23,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:23,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:23,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:23,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:24,215 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:24,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:24 BoogieIcfgContainer [2018-10-27 06:12:24,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:24,216 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:24,216 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:24,219 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:24,220 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:24,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:23" (1/3) ... [2018-10-27 06:12:24,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2304322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:24, skipping insertion in model container [2018-10-27 06:12:24,221 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:24,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:23" (2/3) ... [2018-10-27 06:12:24,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2304322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:24, skipping insertion in model container [2018-10-27 06:12:24,222 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:24,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:24" (3/3) ... [2018-10-27 06:12:24,223 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:12:24,274 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:24,275 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:24,275 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:24,275 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:24,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:24,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:24,275 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:24,276 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:24,276 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:24,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2018-10-27 06:12:24,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-10-27 06:12:24,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:24,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:24,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:24,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:24,318 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:24,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2018-10-27 06:12:24,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-10-27 06:12:24,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:24,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:24,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:24,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:24,331 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 20#L209true [2018-10-27 06:12:24,332 INFO L795 eck$LassoCheckResult]: Loop: 20#L209true assume true; 5#L51-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 49#L53true assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 50#L86true assume main_~p1~0 != 0;main_~lk1~0 := 1; 36#L86-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 53#L90-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 45#L94-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 14#L98-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 4#L102-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 8#L106-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 27#L110-1true assume !(main_~p8~0 != 0); 21#L114-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 37#L118-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 40#L122-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 34#L126-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 51#L130-1true assume main_~p13~0 != 0;main_~lk13~0 := 1; 42#L134-1true assume main_~p14~0 != 0;main_~lk14~0 := 1; 47#L138-1true assume !(main_~p1~0 != 0); 30#L144-1true assume main_~p2~0 != 0; 25#L150true assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 11#L149true assume !(main_~p3~0 != 0); 29#L154-1true assume !(main_~p4~0 != 0); 35#L159-1true assume !(main_~p5~0 != 0); 18#L164-1true assume !(main_~p6~0 != 0); 22#L169-1true assume !(main_~p7~0 != 0); 52#L174-1true assume !(main_~p8~0 != 0); 6#L179-1true assume !(main_~p9~0 != 0); 38#L184-1true assume !(main_~p10~0 != 0); 44#L189-1true assume !(main_~p11~0 != 0); 26#L194-1true assume !(main_~p12~0 != 0); 32#L199-1true assume !(main_~p13~0 != 0); 13#L204-1true assume main_~p14~0 != 0; 33#L210true assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 20#L209true [2018-10-27 06:12:24,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,337 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:12:24,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 916869347, now seen corresponding path program 1 times [2018-10-27 06:12:24,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:24,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:24,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:24,516 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:24,533 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2018-10-27 06:12:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:24,600 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2018-10-27 06:12:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:24,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 180 transitions. [2018-10-27 06:12:24,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-10-27 06:12:24,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 141 transitions. [2018-10-27 06:12:24,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-10-27 06:12:24,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-10-27 06:12:24,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 141 transitions. [2018-10-27 06:12:24,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:24,616 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 141 transitions. [2018-10-27 06:12:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 141 transitions. [2018-10-27 06:12:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-27 06:12:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 06:12:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2018-10-27 06:12:24,646 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 141 transitions. [2018-10-27 06:12:24,646 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 141 transitions. [2018-10-27 06:12:24,646 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:24,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 141 transitions. [2018-10-27 06:12:24,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-10-27 06:12:24,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:24,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:24,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:24,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:24,649 INFO L793 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 177#L209 [2018-10-27 06:12:24,649 INFO L795 eck$LassoCheckResult]: Loop: 177#L209 assume true; 216#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 211#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 212#L86 assume !(main_~p1~0 != 0); 215#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 252#L90-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 251#L94-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 250#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 249#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 248#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 247#L110-1 assume !(main_~p8~0 != 0); 246#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 245#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 244#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 243#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 242#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 241#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 240#L138-1 assume !(main_~p1~0 != 0); 239#L144-1 assume main_~p2~0 != 0; 238#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 237#L149 assume !(main_~p3~0 != 0); 234#L154-1 assume !(main_~p4~0 != 0); 233#L159-1 assume !(main_~p5~0 != 0); 231#L164-1 assume !(main_~p6~0 != 0); 228#L169-1 assume !(main_~p7~0 != 0); 227#L174-1 assume !(main_~p8~0 != 0); 225#L179-1 assume !(main_~p9~0 != 0); 223#L184-1 assume !(main_~p10~0 != 0); 207#L189-1 assume !(main_~p11~0 != 0); 199#L194-1 assume !(main_~p12~0 != 0); 170#L199-1 assume !(main_~p13~0 != 0); 171#L204-1 assume main_~p14~0 != 0; 176#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 177#L209 [2018-10-27 06:12:24,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:12:24,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 939501601, now seen corresponding path program 1 times [2018-10-27 06:12:24,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:24,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:24,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:24,714 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:24,715 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-10-27 06:12:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:24,763 INFO L93 Difference]: Finished difference Result 178 states and 274 transitions. [2018-10-27 06:12:24,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:24,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 274 transitions. [2018-10-27 06:12:24,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2018-10-27 06:12:24,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 178 states and 274 transitions. [2018-10-27 06:12:24,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2018-10-27 06:12:24,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2018-10-27 06:12:24,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 274 transitions. [2018-10-27 06:12:24,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:24,775 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 274 transitions. [2018-10-27 06:12:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 274 transitions. [2018-10-27 06:12:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-27 06:12:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-27 06:12:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 274 transitions. [2018-10-27 06:12:24,794 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 274 transitions. [2018-10-27 06:12:24,795 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 274 transitions. [2018-10-27 06:12:24,795 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:24,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 274 transitions. [2018-10-27 06:12:24,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2018-10-27 06:12:24,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:24,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:24,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:24,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:24,799 INFO L793 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 466#L209 [2018-10-27 06:12:24,799 INFO L795 eck$LassoCheckResult]: Loop: 466#L209 assume true; 592#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 591#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 590#L86 assume !(main_~p1~0 != 0); 589#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 588#L90-1 assume !(main_~p3~0 != 0); 586#L94-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 574#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 575#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 570#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 571#L110-1 assume !(main_~p8~0 != 0); 566#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 567#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 562#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 563#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 558#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 559#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 554#L138-1 assume !(main_~p1~0 != 0); 555#L144-1 assume main_~p2~0 != 0; 550#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 551#L149 assume !(main_~p3~0 != 0); 578#L154-1 assume !(main_~p4~0 != 0); 613#L159-1 assume !(main_~p5~0 != 0); 611#L164-1 assume !(main_~p6~0 != 0); 608#L169-1 assume !(main_~p7~0 != 0); 607#L174-1 assume !(main_~p8~0 != 0); 605#L179-1 assume !(main_~p9~0 != 0); 603#L184-1 assume !(main_~p10~0 != 0); 601#L189-1 assume !(main_~p11~0 != 0); 599#L194-1 assume !(main_~p12~0 != 0); 597#L199-1 assume !(main_~p13~0 != 0); 594#L204-1 assume main_~p14~0 != 0; 593#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 466#L209 [2018-10-27 06:12:24,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:12:24,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:24,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:24,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash 430028511, now seen corresponding path program 1 times [2018-10-27 06:12:24,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:24,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:24,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:24,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:24,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:24,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:24,894 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:24,894 INFO L87 Difference]: Start difference. First operand 178 states and 274 transitions. cyclomatic complexity: 100 Second operand 3 states. [2018-10-27 06:12:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:24,964 INFO L93 Difference]: Finished difference Result 350 states and 534 transitions. [2018-10-27 06:12:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:24,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 534 transitions. [2018-10-27 06:12:24,974 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 348 [2018-10-27 06:12:24,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 534 transitions. [2018-10-27 06:12:24,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-10-27 06:12:24,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2018-10-27 06:12:24,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 534 transitions. [2018-10-27 06:12:24,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:24,984 INFO L705 BuchiCegarLoop]: Abstraction has 350 states and 534 transitions. [2018-10-27 06:12:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 534 transitions. [2018-10-27 06:12:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-10-27 06:12:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-27 06:12:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 534 transitions. [2018-10-27 06:12:25,003 INFO L728 BuchiCegarLoop]: Abstraction has 350 states and 534 transitions. [2018-10-27 06:12:25,004 INFO L608 BuchiCegarLoop]: Abstraction has 350 states and 534 transitions. [2018-10-27 06:12:25,004 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:25,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 534 transitions. [2018-10-27 06:12:25,006 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 348 [2018-10-27 06:12:25,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:25,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,007 INFO L793 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 999#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 1000#L209 [2018-10-27 06:12:25,010 INFO L795 eck$LassoCheckResult]: Loop: 1000#L209 assume true; 1173#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1171#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1167#L86 assume !(main_~p1~0 != 0); 1161#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 1162#L90-1 assume !(main_~p3~0 != 0); 1244#L94-1 assume !(main_~p4~0 != 0); 1242#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1239#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1236#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1233#L110-1 assume !(main_~p8~0 != 0); 1230#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1227#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1224#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1221#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1218#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1163#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 1164#L138-1 assume !(main_~p1~0 != 0); 1157#L144-1 assume main_~p2~0 != 0; 1158#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 1147#L149 assume !(main_~p3~0 != 0); 1148#L154-1 assume !(main_~p4~0 != 0); 1214#L159-1 assume !(main_~p5~0 != 0); 1210#L164-1 assume !(main_~p6~0 != 0); 1205#L169-1 assume !(main_~p7~0 != 0); 1202#L174-1 assume !(main_~p8~0 != 0); 1198#L179-1 assume !(main_~p9~0 != 0); 1194#L184-1 assume !(main_~p10~0 != 0); 1190#L189-1 assume !(main_~p11~0 != 0); 1186#L194-1 assume !(main_~p12~0 != 0); 1182#L199-1 assume !(main_~p13~0 != 0); 1178#L204-1 assume main_~p14~0 != 0; 1176#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 1000#L209 [2018-10-27 06:12:25,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:12:25,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1941710751, now seen corresponding path program 1 times [2018-10-27 06:12:25,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:25,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:25,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:25,057 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:25,058 INFO L87 Difference]: Start difference. First operand 350 states and 534 transitions. cyclomatic complexity: 192 Second operand 3 states. [2018-10-27 06:12:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:25,099 INFO L93 Difference]: Finished difference Result 690 states and 1042 transitions. [2018-10-27 06:12:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:25,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 1042 transitions. [2018-10-27 06:12:25,103 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 688 [2018-10-27 06:12:25,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 690 states and 1042 transitions. [2018-10-27 06:12:25,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2018-10-27 06:12:25,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2018-10-27 06:12:25,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 690 states and 1042 transitions. [2018-10-27 06:12:25,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:25,113 INFO L705 BuchiCegarLoop]: Abstraction has 690 states and 1042 transitions. [2018-10-27 06:12:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states and 1042 transitions. [2018-10-27 06:12:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2018-10-27 06:12:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-27 06:12:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1042 transitions. [2018-10-27 06:12:25,135 INFO L728 BuchiCegarLoop]: Abstraction has 690 states and 1042 transitions. [2018-10-27 06:12:25,136 INFO L608 BuchiCegarLoop]: Abstraction has 690 states and 1042 transitions. [2018-10-27 06:12:25,136 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:25,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 1042 transitions. [2018-10-27 06:12:25,139 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 688 [2018-10-27 06:12:25,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:25,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,140 INFO L793 eck$LassoCheckResult]: Stem: 2071#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2045#L209 [2018-10-27 06:12:25,141 INFO L795 eck$LassoCheckResult]: Loop: 2045#L209 assume true; 2283#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2281#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2278#L86 assume !(main_~p1~0 != 0); 2273#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 2274#L90-1 assume !(main_~p3~0 != 0); 2256#L94-1 assume !(main_~p4~0 != 0); 2258#L98-1 assume !(main_~p5~0 != 0); 2240#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2241#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2224#L110-1 assume !(main_~p8~0 != 0); 2225#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 2208#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 2209#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 2192#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 2193#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 2176#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 2177#L138-1 assume !(main_~p1~0 != 0); 2329#L144-1 assume main_~p2~0 != 0; 2328#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 2326#L149 assume !(main_~p3~0 != 0); 2324#L154-1 assume !(main_~p4~0 != 0); 2322#L159-1 assume !(main_~p5~0 != 0); 2319#L164-1 assume !(main_~p6~0 != 0); 2314#L169-1 assume !(main_~p7~0 != 0); 2311#L174-1 assume !(main_~p8~0 != 0); 2307#L179-1 assume !(main_~p9~0 != 0); 2303#L184-1 assume !(main_~p10~0 != 0); 2299#L189-1 assume !(main_~p11~0 != 0); 2295#L194-1 assume !(main_~p12~0 != 0); 2291#L199-1 assume !(main_~p13~0 != 0); 2288#L204-1 assume main_~p14~0 != 0; 2286#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 2045#L209 [2018-10-27 06:12:25,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:12:25,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1879671137, now seen corresponding path program 1 times [2018-10-27 06:12:25,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:25,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:25,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:25,189 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:25,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:25,190 INFO L87 Difference]: Start difference. First operand 690 states and 1042 transitions. cyclomatic complexity: 368 Second operand 3 states. [2018-10-27 06:12:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:25,230 INFO L93 Difference]: Finished difference Result 1362 states and 2034 transitions. [2018-10-27 06:12:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:25,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 2034 transitions. [2018-10-27 06:12:25,241 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1360 [2018-10-27 06:12:25,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1362 states and 2034 transitions. [2018-10-27 06:12:25,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1362 [2018-10-27 06:12:25,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1362 [2018-10-27 06:12:25,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 2034 transitions. [2018-10-27 06:12:25,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:25,257 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 2034 transitions. [2018-10-27 06:12:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 2034 transitions. [2018-10-27 06:12:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2018-10-27 06:12:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-10-27 06:12:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2034 transitions. [2018-10-27 06:12:25,284 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 2034 transitions. [2018-10-27 06:12:25,284 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 2034 transitions. [2018-10-27 06:12:25,284 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:25,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 2034 transitions. [2018-10-27 06:12:25,292 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1360 [2018-10-27 06:12:25,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:25,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,293 INFO L793 eck$LassoCheckResult]: Stem: 4134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4103#L209 [2018-10-27 06:12:25,293 INFO L795 eck$LassoCheckResult]: Loop: 4103#L209 assume true; 4210#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4208#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4206#L86 assume !(main_~p1~0 != 0); 4204#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 4200#L90-1 assume !(main_~p3~0 != 0); 4196#L94-1 assume !(main_~p4~0 != 0); 4192#L98-1 assume !(main_~p5~0 != 0); 4188#L102-1 assume !(main_~p6~0 != 0); 4186#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4184#L110-1 assume !(main_~p8~0 != 0); 4182#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 4180#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 4178#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 4176#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 4174#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 4172#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 4169#L138-1 assume !(main_~p1~0 != 0); 4170#L144-1 assume main_~p2~0 != 0; 4160#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 4161#L149 assume !(main_~p3~0 != 0); 4253#L154-1 assume !(main_~p4~0 != 0); 4249#L159-1 assume !(main_~p5~0 != 0); 4245#L164-1 assume !(main_~p6~0 != 0); 4241#L169-1 assume !(main_~p7~0 != 0); 4238#L174-1 assume !(main_~p8~0 != 0); 4234#L179-1 assume !(main_~p9~0 != 0); 4230#L184-1 assume !(main_~p10~0 != 0); 4226#L189-1 assume !(main_~p11~0 != 0); 4222#L194-1 assume !(main_~p12~0 != 0); 4218#L199-1 assume !(main_~p13~0 != 0); 4215#L204-1 assume main_~p14~0 != 0; 4213#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 4103#L209 [2018-10-27 06:12:25,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:12:25,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1739122527, now seen corresponding path program 1 times [2018-10-27 06:12:25,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:25,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:25,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:25,378 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:25,379 INFO L87 Difference]: Start difference. First operand 1362 states and 2034 transitions. cyclomatic complexity: 704 Second operand 3 states. [2018-10-27 06:12:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:25,446 INFO L93 Difference]: Finished difference Result 2690 states and 3970 transitions. [2018-10-27 06:12:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:25,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2690 states and 3970 transitions. [2018-10-27 06:12:25,467 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2688 [2018-10-27 06:12:25,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2690 states to 2690 states and 3970 transitions. [2018-10-27 06:12:25,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2690 [2018-10-27 06:12:25,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2690 [2018-10-27 06:12:25,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2690 states and 3970 transitions. [2018-10-27 06:12:25,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:25,486 INFO L705 BuchiCegarLoop]: Abstraction has 2690 states and 3970 transitions. [2018-10-27 06:12:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states and 3970 transitions. [2018-10-27 06:12:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2018-10-27 06:12:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2018-10-27 06:12:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3970 transitions. [2018-10-27 06:12:25,534 INFO L728 BuchiCegarLoop]: Abstraction has 2690 states and 3970 transitions. [2018-10-27 06:12:25,534 INFO L608 BuchiCegarLoop]: Abstraction has 2690 states and 3970 transitions. [2018-10-27 06:12:25,534 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:12:25,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2690 states and 3970 transitions. [2018-10-27 06:12:25,547 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2688 [2018-10-27 06:12:25,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:25,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,549 INFO L793 eck$LassoCheckResult]: Stem: 8195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 8162#L209 [2018-10-27 06:12:25,549 INFO L795 eck$LassoCheckResult]: Loop: 8162#L209 assume true; 8307#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8303#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8299#L86 assume !(main_~p1~0 != 0); 8295#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 8288#L90-1 assume !(main_~p3~0 != 0); 8280#L94-1 assume !(main_~p4~0 != 0); 8272#L98-1 assume !(main_~p5~0 != 0); 8264#L102-1 assume !(main_~p6~0 != 0); 8258#L106-1 assume !(main_~p7~0 != 0); 8253#L110-1 assume !(main_~p8~0 != 0); 8254#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 8247#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 8248#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 8241#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 8242#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 8234#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 8235#L138-1 assume !(main_~p1~0 != 0); 8404#L144-1 assume main_~p2~0 != 0; 8405#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 8401#L149 assume !(main_~p3~0 != 0); 8396#L154-1 assume !(main_~p4~0 != 0); 8389#L159-1 assume !(main_~p5~0 != 0); 8384#L164-1 assume !(main_~p6~0 != 0); 8381#L169-1 assume !(main_~p7~0 != 0); 8373#L174-1 assume !(main_~p8~0 != 0); 8362#L179-1 assume !(main_~p9~0 != 0); 8346#L184-1 assume !(main_~p10~0 != 0); 8338#L189-1 assume !(main_~p11~0 != 0); 8334#L194-1 assume !(main_~p12~0 != 0); 8324#L199-1 assume !(main_~p13~0 != 0); 8318#L204-1 assume main_~p14~0 != 0; 8314#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 8162#L209 [2018-10-27 06:12:25,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,549 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:12:25,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1873136033, now seen corresponding path program 1 times [2018-10-27 06:12:25,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:25,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:25,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:25,622 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:25,622 INFO L87 Difference]: Start difference. First operand 2690 states and 3970 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2018-10-27 06:12:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:25,716 INFO L93 Difference]: Finished difference Result 5314 states and 7746 transitions. [2018-10-27 06:12:25,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:25,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5314 states and 7746 transitions. [2018-10-27 06:12:25,744 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5312 [2018-10-27 06:12:25,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5314 states to 5314 states and 7746 transitions. [2018-10-27 06:12:25,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5314 [2018-10-27 06:12:25,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5314 [2018-10-27 06:12:25,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5314 states and 7746 transitions. [2018-10-27 06:12:25,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:25,780 INFO L705 BuchiCegarLoop]: Abstraction has 5314 states and 7746 transitions. [2018-10-27 06:12:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states and 7746 transitions. [2018-10-27 06:12:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5314. [2018-10-27 06:12:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-10-27 06:12:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 7746 transitions. [2018-10-27 06:12:25,877 INFO L728 BuchiCegarLoop]: Abstraction has 5314 states and 7746 transitions. [2018-10-27 06:12:25,877 INFO L608 BuchiCegarLoop]: Abstraction has 5314 states and 7746 transitions. [2018-10-27 06:12:25,877 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:12:25,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5314 states and 7746 transitions. [2018-10-27 06:12:25,905 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5312 [2018-10-27 06:12:25,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:25,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,907 INFO L793 eck$LassoCheckResult]: Stem: 16195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 16170#L209 [2018-10-27 06:12:25,908 INFO L795 eck$LassoCheckResult]: Loop: 16170#L209 assume true; 16383#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 16380#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 16378#L86 assume !(main_~p1~0 != 0); 16376#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 16373#L90-1 assume !(main_~p3~0 != 0); 16370#L94-1 assume !(main_~p4~0 != 0); 16334#L98-1 assume !(main_~p5~0 != 0); 16292#L102-1 assume !(main_~p6~0 != 0); 16256#L106-1 assume !(main_~p7~0 != 0); 16257#L110-1 assume !(main_~p8~0 != 0); 16239#L114-1 assume !(main_~p9~0 != 0); 16240#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 16496#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 16493#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 16492#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 16491#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 16489#L138-1 assume !(main_~p1~0 != 0); 16415#L144-1 assume main_~p2~0 != 0; 16413#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 16410#L149 assume !(main_~p3~0 != 0); 16407#L154-1 assume !(main_~p4~0 != 0); 16404#L159-1 assume !(main_~p5~0 != 0); 16402#L164-1 assume !(main_~p6~0 != 0); 16400#L169-1 assume !(main_~p7~0 != 0); 16399#L174-1 assume !(main_~p8~0 != 0); 16396#L179-1 assume !(main_~p9~0 != 0); 16395#L184-1 assume !(main_~p10~0 != 0); 16393#L189-1 assume !(main_~p11~0 != 0); 16391#L194-1 assume !(main_~p12~0 != 0); 16389#L199-1 assume !(main_~p13~0 != 0); 16387#L204-1 assume main_~p14~0 != 0; 16386#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 16170#L209 [2018-10-27 06:12:25,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-10-27 06:12:25,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1654281315, now seen corresponding path program 1 times [2018-10-27 06:12:25,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:26,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:26,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:26,002 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:26,002 INFO L87 Difference]: Start difference. First operand 5314 states and 7746 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2018-10-27 06:12:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:26,100 INFO L93 Difference]: Finished difference Result 10498 states and 15106 transitions. [2018-10-27 06:12:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:26,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10498 states and 15106 transitions. [2018-10-27 06:12:26,144 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10496 [2018-10-27 06:12:26,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10498 states to 10498 states and 15106 transitions. [2018-10-27 06:12:26,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10498 [2018-10-27 06:12:26,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10498 [2018-10-27 06:12:26,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10498 states and 15106 transitions. [2018-10-27 06:12:26,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:26,269 INFO L705 BuchiCegarLoop]: Abstraction has 10498 states and 15106 transitions. [2018-10-27 06:12:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10498 states and 15106 transitions. [2018-10-27 06:12:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10498 to 10498. [2018-10-27 06:12:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10498 states. [2018-10-27 06:12:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10498 states to 10498 states and 15106 transitions. [2018-10-27 06:12:26,421 INFO L728 BuchiCegarLoop]: Abstraction has 10498 states and 15106 transitions. [2018-10-27 06:12:26,422 INFO L608 BuchiCegarLoop]: Abstraction has 10498 states and 15106 transitions. [2018-10-27 06:12:26,422 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:12:26,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10498 states and 15106 transitions. [2018-10-27 06:12:26,452 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10496 [2018-10-27 06:12:26,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:26,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:26,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:26,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:26,454 INFO L793 eck$LassoCheckResult]: Stem: 32020#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31988#L209 [2018-10-27 06:12:26,455 INFO L795 eck$LassoCheckResult]: Loop: 31988#L209 assume true; 32323#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 32314#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 32315#L86 assume !(main_~p1~0 != 0); 32441#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 32442#L90-1 assume !(main_~p3~0 != 0); 32432#L94-1 assume !(main_~p4~0 != 0); 32434#L98-1 assume !(main_~p5~0 != 0); 32421#L102-1 assume !(main_~p6~0 != 0); 32423#L106-1 assume !(main_~p7~0 != 0); 32082#L110-1 assume !(main_~p8~0 != 0); 32083#L114-1 assume !(main_~p9~0 != 0); 32407#L118-1 assume !(main_~p10~0 != 0); 32404#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 32401#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 32399#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 32366#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 32367#L138-1 assume !(main_~p1~0 != 0); 32349#L144-1 assume main_~p2~0 != 0; 32350#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 32384#L149 assume !(main_~p3~0 != 0); 32382#L154-1 assume !(main_~p4~0 != 0); 32380#L159-1 assume !(main_~p5~0 != 0); 32378#L164-1 assume !(main_~p6~0 != 0); 32376#L169-1 assume !(main_~p7~0 != 0); 32313#L174-1 assume !(main_~p8~0 != 0); 32312#L179-1 assume !(main_~p9~0 != 0); 32360#L184-1 assume !(main_~p10~0 != 0); 32361#L189-1 assume !(main_~p11~0 != 0); 32345#L194-1 assume !(main_~p12~0 != 0); 32344#L199-1 assume !(main_~p13~0 != 0); 32330#L204-1 assume main_~p14~0 != 0; 32331#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 31988#L209 [2018-10-27 06:12:26,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-10-27 06:12:26,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:26,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:26,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1231579489, now seen corresponding path program 1 times [2018-10-27 06:12:26,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:26,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:26,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:26,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:26,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:26,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:26,549 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:26,549 INFO L87 Difference]: Start difference. First operand 10498 states and 15106 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2018-10-27 06:12:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:26,692 INFO L93 Difference]: Finished difference Result 20738 states and 29442 transitions. [2018-10-27 06:12:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:26,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20738 states and 29442 transitions. [2018-10-27 06:12:26,772 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20736 [2018-10-27 06:12:26,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20738 states to 20738 states and 29442 transitions. [2018-10-27 06:12:26,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20738 [2018-10-27 06:12:26,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20738 [2018-10-27 06:12:26,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20738 states and 29442 transitions. [2018-10-27 06:12:26,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:26,884 INFO L705 BuchiCegarLoop]: Abstraction has 20738 states and 29442 transitions. [2018-10-27 06:12:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20738 states and 29442 transitions. [2018-10-27 06:12:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20738 to 20738. [2018-10-27 06:12:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20738 states. [2018-10-27 06:12:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20738 states to 20738 states and 29442 transitions. [2018-10-27 06:12:27,347 INFO L728 BuchiCegarLoop]: Abstraction has 20738 states and 29442 transitions. [2018-10-27 06:12:27,347 INFO L608 BuchiCegarLoop]: Abstraction has 20738 states and 29442 transitions. [2018-10-27 06:12:27,347 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:12:27,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20738 states and 29442 transitions. [2018-10-27 06:12:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20736 [2018-10-27 06:12:27,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:27,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:27,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:27,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:27,399 INFO L793 eck$LassoCheckResult]: Stem: 63262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 63229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 63230#L209 [2018-10-27 06:12:27,400 INFO L795 eck$LassoCheckResult]: Loop: 63230#L209 assume true; 63363#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 63361#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 63358#L86 assume !(main_~p1~0 != 0); 63355#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 63352#L90-1 assume !(main_~p3~0 != 0); 63348#L94-1 assume !(main_~p4~0 != 0); 63344#L98-1 assume !(main_~p5~0 != 0); 63340#L102-1 assume !(main_~p6~0 != 0); 63337#L106-1 assume !(main_~p7~0 != 0); 63333#L110-1 assume !(main_~p8~0 != 0); 63334#L114-1 assume !(main_~p9~0 != 0); 63430#L118-1 assume !(main_~p10~0 != 0); 63426#L122-1 assume !(main_~p11~0 != 0); 63424#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 63422#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 63420#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 63416#L138-1 assume !(main_~p1~0 != 0); 63414#L144-1 assume main_~p2~0 != 0; 63412#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 63408#L149 assume !(main_~p3~0 != 0); 63404#L154-1 assume !(main_~p4~0 != 0); 63400#L159-1 assume !(main_~p5~0 != 0); 63396#L164-1 assume !(main_~p6~0 != 0); 63394#L169-1 assume !(main_~p7~0 != 0); 63392#L174-1 assume !(main_~p8~0 != 0); 63387#L179-1 assume !(main_~p9~0 != 0); 63383#L184-1 assume !(main_~p10~0 != 0); 63379#L189-1 assume !(main_~p11~0 != 0); 63376#L194-1 assume !(main_~p12~0 != 0); 63372#L199-1 assume !(main_~p13~0 != 0); 63368#L204-1 assume main_~p14~0 != 0; 63366#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 63230#L209 [2018-10-27 06:12:27,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-10-27 06:12:27,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:27,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2049227939, now seen corresponding path program 1 times [2018-10-27 06:12:27,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:27,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:27,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:27,496 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:27,497 INFO L87 Difference]: Start difference. First operand 20738 states and 29442 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2018-10-27 06:12:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:27,673 INFO L93 Difference]: Finished difference Result 40962 states and 57346 transitions. [2018-10-27 06:12:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:27,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40962 states and 57346 transitions. [2018-10-27 06:12:27,799 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 40960 [2018-10-27 06:12:27,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40962 states to 40962 states and 57346 transitions. [2018-10-27 06:12:27,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40962 [2018-10-27 06:12:27,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40962 [2018-10-27 06:12:27,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40962 states and 57346 transitions. [2018-10-27 06:12:27,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:27,960 INFO L705 BuchiCegarLoop]: Abstraction has 40962 states and 57346 transitions. [2018-10-27 06:12:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40962 states and 57346 transitions. [2018-10-27 06:12:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40962 to 40962. [2018-10-27 06:12:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40962 states. [2018-10-27 06:12:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40962 states to 40962 states and 57346 transitions. [2018-10-27 06:12:28,607 INFO L728 BuchiCegarLoop]: Abstraction has 40962 states and 57346 transitions. [2018-10-27 06:12:28,607 INFO L608 BuchiCegarLoop]: Abstraction has 40962 states and 57346 transitions. [2018-10-27 06:12:28,607 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:12:28,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40962 states and 57346 transitions. [2018-10-27 06:12:28,708 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 40960 [2018-10-27 06:12:28,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:28,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:28,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:28,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:28,709 INFO L793 eck$LassoCheckResult]: Stem: 124968#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 124935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 124936#L209 [2018-10-27 06:12:28,709 INFO L795 eck$LassoCheckResult]: Loop: 124936#L209 assume true; 125309#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 125308#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 125306#L86 assume !(main_~p1~0 != 0); 125304#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 125300#L90-1 assume !(main_~p3~0 != 0); 125296#L94-1 assume !(main_~p4~0 != 0); 125292#L98-1 assume !(main_~p5~0 != 0); 125288#L102-1 assume !(main_~p6~0 != 0); 125284#L106-1 assume !(main_~p7~0 != 0); 125282#L110-1 assume !(main_~p8~0 != 0); 125278#L114-1 assume !(main_~p9~0 != 0); 125274#L118-1 assume !(main_~p10~0 != 0); 125270#L122-1 assume !(main_~p11~0 != 0); 125267#L126-1 assume !(main_~p12~0 != 0); 125263#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 125264#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 125255#L138-1 assume !(main_~p1~0 != 0); 125257#L144-1 assume main_~p2~0 != 0; 125356#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 125353#L149 assume !(main_~p3~0 != 0); 125349#L154-1 assume !(main_~p4~0 != 0); 125345#L159-1 assume !(main_~p5~0 != 0); 125341#L164-1 assume !(main_~p6~0 != 0); 125337#L169-1 assume !(main_~p7~0 != 0); 125334#L174-1 assume !(main_~p8~0 != 0); 125329#L179-1 assume !(main_~p9~0 != 0); 125325#L184-1 assume !(main_~p10~0 != 0); 125321#L189-1 assume !(main_~p11~0 != 0); 125318#L194-1 assume !(main_~p12~0 != 0); 125313#L199-1 assume !(main_~p13~0 != 0); 125311#L204-1 assume main_~p14~0 != 0; 125310#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 124936#L209 [2018-10-27 06:12:28,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-10-27 06:12:28,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:28,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 556795615, now seen corresponding path program 1 times [2018-10-27 06:12:28,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:28,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:28,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:28,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:28,791 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:28,792 INFO L87 Difference]: Start difference. First operand 40962 states and 57346 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2018-10-27 06:12:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:29,026 INFO L93 Difference]: Finished difference Result 80898 states and 111618 transitions. [2018-10-27 06:12:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:29,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80898 states and 111618 transitions. [2018-10-27 06:12:29,603 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 80896 [2018-10-27 06:12:29,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80898 states to 80898 states and 111618 transitions. [2018-10-27 06:12:29,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80898 [2018-10-27 06:12:29,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80898 [2018-10-27 06:12:29,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80898 states and 111618 transitions. [2018-10-27 06:12:29,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:29,865 INFO L705 BuchiCegarLoop]: Abstraction has 80898 states and 111618 transitions. [2018-10-27 06:12:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80898 states and 111618 transitions. [2018-10-27 06:12:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80898 to 80898. [2018-10-27 06:12:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80898 states. [2018-10-27 06:12:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80898 states to 80898 states and 111618 transitions. [2018-10-27 06:12:30,934 INFO L728 BuchiCegarLoop]: Abstraction has 80898 states and 111618 transitions. [2018-10-27 06:12:30,934 INFO L608 BuchiCegarLoop]: Abstraction has 80898 states and 111618 transitions. [2018-10-27 06:12:30,934 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:12:30,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80898 states and 111618 transitions. [2018-10-27 06:12:31,084 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 80896 [2018-10-27 06:12:31,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:31,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:31,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:31,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:31,085 INFO L793 eck$LassoCheckResult]: Stem: 246834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 246800#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 246801#L209 [2018-10-27 06:12:31,085 INFO L795 eck$LassoCheckResult]: Loop: 246801#L209 assume true; 247382#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 247374#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 247375#L86 assume !(main_~p1~0 != 0); 247358#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 247359#L90-1 assume !(main_~p3~0 != 0); 247341#L94-1 assume !(main_~p4~0 != 0); 247343#L98-1 assume !(main_~p5~0 != 0); 247323#L102-1 assume !(main_~p6~0 != 0); 247325#L106-1 assume !(main_~p7~0 != 0); 247468#L110-1 assume !(main_~p8~0 != 0); 247464#L114-1 assume !(main_~p9~0 != 0); 247460#L118-1 assume !(main_~p10~0 != 0); 247456#L122-1 assume !(main_~p11~0 != 0); 247453#L126-1 assume !(main_~p12~0 != 0); 247451#L130-1 assume !(main_~p13~0 != 0); 247447#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 247443#L138-1 assume !(main_~p1~0 != 0); 247440#L144-1 assume main_~p2~0 != 0; 247435#L150 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 247429#L149 assume !(main_~p3~0 != 0); 247423#L154-1 assume !(main_~p4~0 != 0); 247417#L159-1 assume !(main_~p5~0 != 0); 247413#L164-1 assume !(main_~p6~0 != 0); 247411#L169-1 assume !(main_~p7~0 != 0); 247408#L174-1 assume !(main_~p8~0 != 0); 247404#L179-1 assume !(main_~p9~0 != 0); 247401#L184-1 assume !(main_~p10~0 != 0); 247397#L189-1 assume !(main_~p11~0 != 0); 247371#L194-1 assume !(main_~p12~0 != 0); 247373#L199-1 assume !(main_~p13~0 != 0); 247389#L204-1 assume main_~p14~0 != 0; 247390#L210 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 246801#L209 [2018-10-27 06:12:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-10-27 06:12:31,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1437349091, now seen corresponding path program 1 times [2018-10-27 06:12:31,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1538443163, now seen corresponding path program 1 times [2018-10-27 06:12:31,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,497 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-27 06:12:31,737 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 06:12:31,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:31 BoogieIcfgContainer [2018-10-27 06:12:31,824 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:31,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:31,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:31,825 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:31,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:24" (3/4) ... [2018-10-27 06:12:31,828 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:12:31,908 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b34ecbfb-c71f-4cdb-b4df-ec6135655081/bin-2019/uautomizer/witness.graphml [2018-10-27 06:12:31,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:31,909 INFO L168 Benchmark]: Toolchain (without parser) took 8774.95 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 540.5 MB). Free memory was 954.4 MB in the beginning and 839.6 MB in the end (delta: 114.9 MB). Peak memory consumption was 655.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,910 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:31,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.34 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.37 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:31,911 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,911 INFO L168 Benchmark]: RCFGBuilder took 756.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 938.3 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,912 INFO L168 Benchmark]: BuchiAutomizer took 7608.08 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 353.9 MB). Free memory was 1.2 GB in the beginning and 848.2 MB in the end (delta: 314.8 MB). Peak memory consumption was 668.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,912 INFO L168 Benchmark]: Witness Printer took 83.68 ms. Allocated memory is still 1.6 GB. Free memory was 848.2 MB in the beginning and 839.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:31,914 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.34 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.37 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 756.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 938.3 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7608.08 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 353.9 MB). Free memory was 1.2 GB in the beginning and 848.2 MB in the end (delta: 314.8 MB). Peak memory consumption was 668.6 MB. Max. memory is 11.5 GB. * Witness Printer took 83.68 ms. Allocated memory is still 1.6 GB. Free memory was 848.2 MB in the beginning and 839.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 80898 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.6s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had 80898 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1211 SDtfs, 615 SDslu, 756 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 51]: 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 {p1=0, \result=0, p3=0, p2=1, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@414d6cb9=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a163e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e46c5ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@674fb3dd=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bd7443a=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32c637c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dec61ca=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1844bd8d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b86fd4f=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@633ff771=0, p14=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f073f5d=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6df17fbf=0, lk11=0, cond=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@485f835d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20df7709=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23a46cad=2, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND TRUE p2 != 0 [L91] lk2 = 1 [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND TRUE p14 != 0 [L139] lk14 = 1 [L144] COND FALSE !(p1 != 0) [L149] COND TRUE p2 != 0 [L150] COND FALSE !(lk2 != 1) [L151] lk2 = 0 [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND TRUE p14 != 0 [L210] COND FALSE !(lk14 != 1) [L211] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...