java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:12,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:12,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:12,448 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:12,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:12,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:12,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:12,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:12,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:12,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:12,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:12,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:12,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:12,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:12,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:12,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:12,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:12,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:12,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:12,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:12,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:12,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:12,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:12,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:12,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:12,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:12,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:12,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:12,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:12,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:12,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:12,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:12,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:12,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:12,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:12,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:12,485 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:12,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:12,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:12,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:12,495 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:12,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:12,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:12,496 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:12,496 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:12,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:12,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:12,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:12,568 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:12,569 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:12,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-26 08:06:12,570 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-26 08:06:12,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:12,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:12,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:12,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:12,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:12,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,727 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:12,727 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:12,727 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:12,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:12,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:12,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:12,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:12,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:12,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:12,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:12,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:12,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/1) ... [2018-09-26 08:06:12,900 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:13,426 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:13,427 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:13 BoogieIcfgContainer [2018-09-26 08:06:13,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:13,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:13,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:13,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:13,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:12" (1/2) ... [2018-09-26 08:06:13,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639eb0d1 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:13, skipping insertion in model container [2018-09-26 08:06:13,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:13" (2/2) ... [2018-09-26 08:06:13,438 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-26 08:06:13,449 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:13,461 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-26 08:06:13,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:13,515 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:13,515 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:13,516 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:13,516 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:13,516 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:13,516 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:13,516 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:13,517 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-09-26 08:06:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:13,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:13,552 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1483933, now seen corresponding path program 1 times [2018-09-26 08:06:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:13,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:13,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:13,717 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-09-26 08:06:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,416 INFO L93 Difference]: Finished difference Result 83 states and 244 transitions. [2018-09-26 08:06:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:14,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,445 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:06:14,445 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:06:14,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:06:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-09-26 08:06:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:06:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 188 transitions. [2018-09-26 08:06:14,532 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 188 transitions. Word has length 4 [2018-09-26 08:06:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,534 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 188 transitions. [2018-09-26 08:06:14,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 188 transitions. [2018-09-26 08:06:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:14,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:14,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1486926, now seen corresponding path program 1 times [2018-09-26 08:06:14,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:14,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:14,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:14,602 INFO L87 Difference]: Start difference. First operand 67 states and 188 transitions. Second operand 5 states. [2018-09-26 08:06:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,106 INFO L93 Difference]: Finished difference Result 141 states and 439 transitions. [2018-09-26 08:06:15,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:15,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,113 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:06:15,114 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:06:15,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:06:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2018-09-26 08:06:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:06:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 316 transitions. [2018-09-26 08:06:15,174 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 316 transitions. Word has length 4 [2018-09-26 08:06:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,174 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 316 transitions. [2018-09-26 08:06:15,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 316 transitions. [2018-09-26 08:06:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:15,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:15,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash 951145, now seen corresponding path program 1 times [2018-09-26 08:06:15,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,233 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:15,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:15,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:15,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:15,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:15,235 INFO L87 Difference]: Start difference. First operand 95 states and 316 transitions. Second operand 5 states. [2018-09-26 08:06:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,615 INFO L93 Difference]: Finished difference Result 161 states and 531 transitions. [2018-09-26 08:06:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:15,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,622 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:06:15,622 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:06:15,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:06:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2018-09-26 08:06:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:06:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 408 transitions. [2018-09-26 08:06:15,664 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 408 transitions. Word has length 4 [2018-09-26 08:06:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,665 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 408 transitions. [2018-09-26 08:06:15,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 408 transitions. [2018-09-26 08:06:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:15,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:15,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687860, now seen corresponding path program 1 times [2018-09-26 08:06:15,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:15,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:15,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:15,704 INFO L87 Difference]: Start difference. First operand 115 states and 408 transitions. Second operand 7 states. [2018-09-26 08:06:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,579 INFO L93 Difference]: Finished difference Result 429 states and 1559 transitions. [2018-09-26 08:06:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:16,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,587 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:06:16,587 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:06:16,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:06:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 197. [2018-09-26 08:06:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:06:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 815 transitions. [2018-09-26 08:06:16,651 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 815 transitions. Word has length 6 [2018-09-26 08:06:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,651 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 815 transitions. [2018-09-26 08:06:16,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 815 transitions. [2018-09-26 08:06:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:16,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,655 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687863, now seen corresponding path program 1 times [2018-09-26 08:06:16,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:16,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:16,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:16,689 INFO L87 Difference]: Start difference. First operand 197 states and 815 transitions. Second operand 7 states. [2018-09-26 08:06:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,713 INFO L93 Difference]: Finished difference Result 469 states and 1652 transitions. [2018-09-26 08:06:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:17,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,719 INFO L225 Difference]: With dead ends: 469 [2018-09-26 08:06:17,720 INFO L226 Difference]: Without dead ends: 463 [2018-09-26 08:06:17,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-09-26 08:06:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 221. [2018-09-26 08:06:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:06:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 931 transitions. [2018-09-26 08:06:17,820 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 931 transitions. Word has length 6 [2018-09-26 08:06:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,820 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 931 transitions. [2018-09-26 08:06:17,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 931 transitions. [2018-09-26 08:06:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:17,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:17,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1424690216, now seen corresponding path program 1 times [2018-09-26 08:06:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,855 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:17,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:17,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:17,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:17,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:17,856 INFO L87 Difference]: Start difference. First operand 221 states and 931 transitions. Second operand 7 states. [2018-09-26 08:06:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,680 INFO L93 Difference]: Finished difference Result 425 states and 1563 transitions. [2018-09-26 08:06:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:18,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,686 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:06:18,686 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:06:18,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:06:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 235. [2018-09-26 08:06:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:06:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 1000 transitions. [2018-09-26 08:06:18,762 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 1000 transitions. Word has length 6 [2018-09-26 08:06:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,763 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 1000 transitions. [2018-09-26 08:06:18,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 1000 transitions. [2018-09-26 08:06:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:18,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:18,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1424690219, now seen corresponding path program 1 times [2018-09-26 08:06:18,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,807 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:18,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:18,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:18,809 INFO L87 Difference]: Start difference. First operand 235 states and 1000 transitions. Second operand 7 states. [2018-09-26 08:06:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,589 INFO L93 Difference]: Finished difference Result 461 states and 1684 transitions. [2018-09-26 08:06:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:19,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,596 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:06:19,597 INFO L226 Difference]: Without dead ends: 455 [2018-09-26 08:06:19,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-09-26 08:06:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 233. [2018-09-26 08:06:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:06:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 991 transitions. [2018-09-26 08:06:19,672 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 991 transitions. Word has length 6 [2018-09-26 08:06:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,675 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 991 transitions. [2018-09-26 08:06:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 991 transitions. [2018-09-26 08:06:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:19,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:19,678 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662275, now seen corresponding path program 1 times [2018-09-26 08:06:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:19,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:19,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:19,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:19,708 INFO L87 Difference]: Start difference. First operand 233 states and 991 transitions. Second operand 7 states. [2018-09-26 08:06:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,543 INFO L93 Difference]: Finished difference Result 532 states and 2077 transitions. [2018-09-26 08:06:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:20,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,549 INFO L225 Difference]: With dead ends: 532 [2018-09-26 08:06:20,549 INFO L226 Difference]: Without dead ends: 526 [2018-09-26 08:06:20,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-09-26 08:06:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 318. [2018-09-26 08:06:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 08:06:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1405 transitions. [2018-09-26 08:06:20,642 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1405 transitions. Word has length 6 [2018-09-26 08:06:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,642 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 1405 transitions. [2018-09-26 08:06:20,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1405 transitions. [2018-09-26 08:06:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:20,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:20,645 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662278, now seen corresponding path program 1 times [2018-09-26 08:06:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:20,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:20,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:20,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:20,666 INFO L87 Difference]: Start difference. First operand 318 states and 1405 transitions. Second operand 7 states. [2018-09-26 08:06:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,334 INFO L93 Difference]: Finished difference Result 795 states and 3375 transitions. [2018-09-26 08:06:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:21,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,340 INFO L225 Difference]: With dead ends: 795 [2018-09-26 08:06:21,340 INFO L226 Difference]: Without dead ends: 478 [2018-09-26 08:06:21,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-09-26 08:06:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 344. [2018-09-26 08:06:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-09-26 08:06:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1488 transitions. [2018-09-26 08:06:21,482 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1488 transitions. Word has length 6 [2018-09-26 08:06:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,482 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 1488 transitions. [2018-09-26 08:06:21,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1488 transitions. [2018-09-26 08:06:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:21,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:21,487 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1426082271, now seen corresponding path program 1 times [2018-09-26 08:06:21,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:21,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:21,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:21,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:21,506 INFO L87 Difference]: Start difference. First operand 344 states and 1488 transitions. Second operand 7 states. [2018-09-26 08:06:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,256 INFO L93 Difference]: Finished difference Result 559 states and 2201 transitions. [2018-09-26 08:06:22,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:22,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,262 INFO L225 Difference]: With dead ends: 559 [2018-09-26 08:06:22,263 INFO L226 Difference]: Without dead ends: 553 [2018-09-26 08:06:22,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-09-26 08:06:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 350. [2018-09-26 08:06:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-09-26 08:06:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1507 transitions. [2018-09-26 08:06:22,387 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1507 transitions. Word has length 6 [2018-09-26 08:06:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,387 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 1507 transitions. [2018-09-26 08:06:22,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1507 transitions. [2018-09-26 08:06:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:22,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:22,390 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1426082274, now seen corresponding path program 1 times [2018-09-26 08:06:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,408 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:22,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:22,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:22,409 INFO L87 Difference]: Start difference. First operand 350 states and 1507 transitions. Second operand 7 states. [2018-09-26 08:06:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,255 INFO L93 Difference]: Finished difference Result 589 states and 2338 transitions. [2018-09-26 08:06:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:23,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,261 INFO L225 Difference]: With dead ends: 589 [2018-09-26 08:06:23,262 INFO L226 Difference]: Without dead ends: 583 [2018-09-26 08:06:23,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-09-26 08:06:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 356. [2018-09-26 08:06:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-26 08:06:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1534 transitions. [2018-09-26 08:06:23,386 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1534 transitions. Word has length 6 [2018-09-26 08:06:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,387 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 1534 transitions. [2018-09-26 08:06:23,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1534 transitions. [2018-09-26 08:06:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:23,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:23,389 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063228, now seen corresponding path program 1 times [2018-09-26 08:06:23,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,415 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:23,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:23,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:23,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:23,416 INFO L87 Difference]: Start difference. First operand 356 states and 1534 transitions. Second operand 7 states. [2018-09-26 08:06:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,154 INFO L93 Difference]: Finished difference Result 614 states and 2391 transitions. [2018-09-26 08:06:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:24,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,161 INFO L225 Difference]: With dead ends: 614 [2018-09-26 08:06:24,161 INFO L226 Difference]: Without dead ends: 608 [2018-09-26 08:06:24,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-26 08:06:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 381. [2018-09-26 08:06:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:06:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1666 transitions. [2018-09-26 08:06:24,296 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1666 transitions. Word has length 6 [2018-09-26 08:06:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,297 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 1666 transitions. [2018-09-26 08:06:24,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1666 transitions. [2018-09-26 08:06:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:24,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:24,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063231, now seen corresponding path program 1 times [2018-09-26 08:06:24,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:24,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:24,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:24,327 INFO L87 Difference]: Start difference. First operand 381 states and 1666 transitions. Second operand 7 states. [2018-09-26 08:06:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,981 INFO L93 Difference]: Finished difference Result 872 states and 3679 transitions. [2018-09-26 08:06:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:24,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,987 INFO L225 Difference]: With dead ends: 872 [2018-09-26 08:06:24,988 INFO L226 Difference]: Without dead ends: 492 [2018-09-26 08:06:24,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-09-26 08:06:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 406. [2018-09-26 08:06:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-09-26 08:06:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1759 transitions. [2018-09-26 08:06:25,181 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1759 transitions. Word has length 6 [2018-09-26 08:06:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,181 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 1759 transitions. [2018-09-26 08:06:25,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1759 transitions. [2018-09-26 08:06:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:25,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:25,186 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050270, now seen corresponding path program 1 times [2018-09-26 08:06:25,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,211 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:25,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:25,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:25,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:25,213 INFO L87 Difference]: Start difference. First operand 406 states and 1759 transitions. Second operand 7 states. [2018-09-26 08:06:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,080 INFO L93 Difference]: Finished difference Result 642 states and 2484 transitions. [2018-09-26 08:06:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:26,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,087 INFO L225 Difference]: With dead ends: 642 [2018-09-26 08:06:26,087 INFO L226 Difference]: Without dead ends: 636 [2018-09-26 08:06:26,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-09-26 08:06:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 394. [2018-09-26 08:06:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 08:06:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1695 transitions. [2018-09-26 08:06:26,243 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1695 transitions. Word has length 6 [2018-09-26 08:06:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,243 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 1695 transitions. [2018-09-26 08:06:26,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1695 transitions. [2018-09-26 08:06:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:26,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050273, now seen corresponding path program 1 times [2018-09-26 08:06:26,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:26,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:26,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:26,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:26,267 INFO L87 Difference]: Start difference. First operand 394 states and 1695 transitions. Second operand 7 states. [2018-09-26 08:06:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,904 INFO L93 Difference]: Finished difference Result 530 states and 2122 transitions. [2018-09-26 08:06:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:26,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,912 INFO L225 Difference]: With dead ends: 530 [2018-09-26 08:06:26,914 INFO L226 Difference]: Without dead ends: 524 [2018-09-26 08:06:26,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-09-26 08:06:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 394. [2018-09-26 08:06:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 08:06:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1695 transitions. [2018-09-26 08:06:27,095 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1695 transitions. Word has length 6 [2018-09-26 08:06:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,095 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 1695 transitions. [2018-09-26 08:06:27,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1695 transitions. [2018-09-26 08:06:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:27,097 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,098 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1418574259, now seen corresponding path program 1 times [2018-09-26 08:06:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:27,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:27,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:27,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:27,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:27,141 INFO L87 Difference]: Start difference. First operand 394 states and 1695 transitions. Second operand 7 states. [2018-09-26 08:06:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,851 INFO L93 Difference]: Finished difference Result 811 states and 3241 transitions. [2018-09-26 08:06:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:27,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,859 INFO L225 Difference]: With dead ends: 811 [2018-09-26 08:06:27,859 INFO L226 Difference]: Without dead ends: 805 [2018-09-26 08:06:27,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-09-26 08:06:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 455. [2018-09-26 08:06:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-26 08:06:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 2000 transitions. [2018-09-26 08:06:28,035 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 2000 transitions. Word has length 6 [2018-09-26 08:06:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,036 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 2000 transitions. [2018-09-26 08:06:28,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 2000 transitions. [2018-09-26 08:06:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:28,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,038 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1418574132, now seen corresponding path program 1 times [2018-09-26 08:06:28,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:28,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:28,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:28,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:28,072 INFO L87 Difference]: Start difference. First operand 455 states and 2000 transitions. Second operand 7 states. [2018-09-26 08:06:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,854 INFO L93 Difference]: Finished difference Result 829 states and 3301 transitions. [2018-09-26 08:06:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:28,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,863 INFO L225 Difference]: With dead ends: 829 [2018-09-26 08:06:28,863 INFO L226 Difference]: Without dead ends: 823 [2018-09-26 08:06:28,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-09-26 08:06:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 480. [2018-09-26 08:06:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-09-26 08:06:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 2125 transitions. [2018-09-26 08:06:29,096 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 2125 transitions. Word has length 6 [2018-09-26 08:06:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,096 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 2125 transitions. [2018-09-26 08:06:29,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 2125 transitions. [2018-09-26 08:06:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:29,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,098 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562851, now seen corresponding path program 1 times [2018-09-26 08:06:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:29,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:29,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:29,133 INFO L87 Difference]: Start difference. First operand 480 states and 2125 transitions. Second operand 7 states. [2018-09-26 08:06:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,968 INFO L93 Difference]: Finished difference Result 858 states and 3471 transitions. [2018-09-26 08:06:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:29,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,977 INFO L225 Difference]: With dead ends: 858 [2018-09-26 08:06:29,978 INFO L226 Difference]: Without dead ends: 852 [2018-09-26 08:06:29,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-26 08:06:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 502. [2018-09-26 08:06:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-26 08:06:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 2231 transitions. [2018-09-26 08:06:30,210 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 2231 transitions. Word has length 6 [2018-09-26 08:06:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,210 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 2231 transitions. [2018-09-26 08:06:30,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 2231 transitions. [2018-09-26 08:06:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:30,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,212 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562724, now seen corresponding path program 1 times [2018-09-26 08:06:30,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,229 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:30,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:30,231 INFO L87 Difference]: Start difference. First operand 502 states and 2231 transitions. Second operand 7 states. [2018-09-26 08:06:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,935 INFO L93 Difference]: Finished difference Result 868 states and 3505 transitions. [2018-09-26 08:06:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:30,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,945 INFO L225 Difference]: With dead ends: 868 [2018-09-26 08:06:30,945 INFO L226 Difference]: Without dead ends: 862 [2018-09-26 08:06:30,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-09-26 08:06:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 516. [2018-09-26 08:06:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-09-26 08:06:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 2303 transitions. [2018-09-26 08:06:31,176 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 2303 transitions. Word has length 6 [2018-09-26 08:06:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 2303 transitions. [2018-09-26 08:06:31,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 2303 transitions. [2018-09-26 08:06:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:31,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,178 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1428797377, now seen corresponding path program 1 times [2018-09-26 08:06:31,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:31,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:31,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:31,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:31,198 INFO L87 Difference]: Start difference. First operand 516 states and 2303 transitions. Second operand 7 states. [2018-09-26 08:06:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,022 INFO L93 Difference]: Finished difference Result 907 states and 3733 transitions. [2018-09-26 08:06:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:32,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,033 INFO L225 Difference]: With dead ends: 907 [2018-09-26 08:06:32,033 INFO L226 Difference]: Without dead ends: 901 [2018-09-26 08:06:32,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-09-26 08:06:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 520. [2018-09-26 08:06:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-26 08:06:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 2319 transitions. [2018-09-26 08:06:32,289 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 2319 transitions. Word has length 6 [2018-09-26 08:06:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,289 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 2319 transitions. [2018-09-26 08:06:32,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 2319 transitions. [2018-09-26 08:06:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:32,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:32,292 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1428797250, now seen corresponding path program 1 times [2018-09-26 08:06:32,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:32,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:32,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:32,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:32,311 INFO L87 Difference]: Start difference. First operand 520 states and 2319 transitions. Second operand 7 states. [2018-09-26 08:06:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,957 INFO L93 Difference]: Finished difference Result 773 states and 3271 transitions. [2018-09-26 08:06:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:32,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,965 INFO L225 Difference]: With dead ends: 773 [2018-09-26 08:06:32,965 INFO L226 Difference]: Without dead ends: 767 [2018-09-26 08:06:32,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-09-26 08:06:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 593. [2018-09-26 08:06:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-09-26 08:06:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2685 transitions. [2018-09-26 08:06:33,300 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2685 transitions. Word has length 6 [2018-09-26 08:06:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,301 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 2685 transitions. [2018-09-26 08:06:33,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2685 transitions. [2018-09-26 08:06:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:33,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,303 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952251, now seen corresponding path program 1 times [2018-09-26 08:06:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:33,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:33,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:33,329 INFO L87 Difference]: Start difference. First operand 593 states and 2685 transitions. Second operand 7 states. [2018-09-26 08:06:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,354 INFO L93 Difference]: Finished difference Result 1183 states and 5111 transitions. [2018-09-26 08:06:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:34,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,366 INFO L225 Difference]: With dead ends: 1183 [2018-09-26 08:06:34,366 INFO L226 Difference]: Without dead ends: 1177 [2018-09-26 08:06:34,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-09-26 08:06:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 745. [2018-09-26 08:06:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-09-26 08:06:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 3444 transitions. [2018-09-26 08:06:34,679 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 3444 transitions. Word has length 6 [2018-09-26 08:06:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,680 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 3444 transitions. [2018-09-26 08:06:34,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 3444 transitions. [2018-09-26 08:06:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:34,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:34,682 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952254, now seen corresponding path program 1 times [2018-09-26 08:06:34,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:34,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:34,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:34,696 INFO L87 Difference]: Start difference. First operand 745 states and 3444 transitions. Second operand 7 states. [2018-09-26 08:06:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,541 INFO L93 Difference]: Finished difference Result 1125 states and 4823 transitions. [2018-09-26 08:06:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:35,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,549 INFO L225 Difference]: With dead ends: 1125 [2018-09-26 08:06:35,550 INFO L226 Difference]: Without dead ends: 1119 [2018-09-26 08:06:35,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-26 08:06:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 749. [2018-09-26 08:06:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-09-26 08:06:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 3456 transitions. [2018-09-26 08:06:35,894 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 3456 transitions. Word has length 6 [2018-09-26 08:06:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,894 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 3456 transitions. [2018-09-26 08:06:35,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 3456 transitions. [2018-09-26 08:06:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:35,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,896 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:06:35,897 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1428955365, now seen corresponding path program 1 times [2018-09-26 08:06:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:35,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:35,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:35,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:35,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:35,905 INFO L87 Difference]: Start difference. First operand 749 states and 3456 transitions. Second operand 4 states. [2018-09-26 08:06:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,321 INFO L93 Difference]: Finished difference Result 1227 states and 5516 transitions. [2018-09-26 08:06:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:36,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:06:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,328 INFO L225 Difference]: With dead ends: 1227 [2018-09-26 08:06:36,328 INFO L226 Difference]: Without dead ends: 722 [2018-09-26 08:06:36,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-09-26 08:06:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 614. [2018-09-26 08:06:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-09-26 08:06:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2719 transitions. [2018-09-26 08:06:36,643 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2719 transitions. Word has length 6 [2018-09-26 08:06:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,643 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 2719 transitions. [2018-09-26 08:06:36,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2719 transitions. [2018-09-26 08:06:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:36,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:36,646 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670078, now seen corresponding path program 1 times [2018-09-26 08:06:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:36,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:36,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:36,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:36,696 INFO L87 Difference]: Start difference. First operand 614 states and 2719 transitions. Second operand 7 states. [2018-09-26 08:06:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,497 INFO L93 Difference]: Finished difference Result 1007 states and 4285 transitions. [2018-09-26 08:06:37,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:37,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,503 INFO L225 Difference]: With dead ends: 1007 [2018-09-26 08:06:37,503 INFO L226 Difference]: Without dead ends: 1001 [2018-09-26 08:06:37,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-09-26 08:06:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 649. [2018-09-26 08:06:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-09-26 08:06:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 2895 transitions. [2018-09-26 08:06:37,733 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 2895 transitions. Word has length 6 [2018-09-26 08:06:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,733 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 2895 transitions. [2018-09-26 08:06:37,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 2895 transitions. [2018-09-26 08:06:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:37,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:37,735 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670081, now seen corresponding path program 1 times [2018-09-26 08:06:37,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:37,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:37,765 INFO L87 Difference]: Start difference. First operand 649 states and 2895 transitions. Second operand 7 states. [2018-09-26 08:06:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,606 INFO L93 Difference]: Finished difference Result 1057 states and 4428 transitions. [2018-09-26 08:06:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:38,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,612 INFO L225 Difference]: With dead ends: 1057 [2018-09-26 08:06:38,612 INFO L226 Difference]: Without dead ends: 1051 [2018-09-26 08:06:38,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-09-26 08:06:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 643. [2018-09-26 08:06:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-09-26 08:06:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2867 transitions. [2018-09-26 08:06:38,864 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2867 transitions. Word has length 6 [2018-09-26 08:06:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,864 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 2867 transitions. [2018-09-26 08:06:38,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2867 transitions. [2018-09-26 08:06:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:38,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,865 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672434, now seen corresponding path program 1 times [2018-09-26 08:06:38,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:38,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:38,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:38,877 INFO L87 Difference]: Start difference. First operand 643 states and 2867 transitions. Second operand 7 states. [2018-09-26 08:06:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,775 INFO L93 Difference]: Finished difference Result 1019 states and 4290 transitions. [2018-09-26 08:06:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:39,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,779 INFO L225 Difference]: With dead ends: 1019 [2018-09-26 08:06:39,780 INFO L226 Difference]: Without dead ends: 1013 [2018-09-26 08:06:39,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-09-26 08:06:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 667. [2018-09-26 08:06:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-09-26 08:06:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2969 transitions. [2018-09-26 08:06:40,114 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2969 transitions. Word has length 6 [2018-09-26 08:06:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,114 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 2969 transitions. [2018-09-26 08:06:40,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2969 transitions. [2018-09-26 08:06:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:40,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,116 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672437, now seen corresponding path program 1 times [2018-09-26 08:06:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:40,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:40,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:40,130 INFO L87 Difference]: Start difference. First operand 667 states and 2969 transitions. Second operand 7 states. [2018-09-26 08:06:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,293 INFO L93 Difference]: Finished difference Result 1100 states and 4588 transitions. [2018-09-26 08:06:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:41,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,298 INFO L225 Difference]: With dead ends: 1100 [2018-09-26 08:06:41,299 INFO L226 Difference]: Without dead ends: 1098 [2018-09-26 08:06:41,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-09-26 08:06:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 636. [2018-09-26 08:06:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-09-26 08:06:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2815 transitions. [2018-09-26 08:06:41,579 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2815 transitions. Word has length 6 [2018-09-26 08:06:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,579 INFO L480 AbstractCegarLoop]: Abstraction has 636 states and 2815 transitions. [2018-09-26 08:06:41,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2815 transitions. [2018-09-26 08:06:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:41,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:41,581 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 914033883, now seen corresponding path program 1 times [2018-09-26 08:06:41,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,639 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:41,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:41,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:41,640 INFO L87 Difference]: Start difference. First operand 636 states and 2815 transitions. Second operand 7 states. [2018-09-26 08:06:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,909 INFO L93 Difference]: Finished difference Result 1140 states and 4821 transitions. [2018-09-26 08:06:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:42,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,915 INFO L225 Difference]: With dead ends: 1140 [2018-09-26 08:06:42,915 INFO L226 Difference]: Without dead ends: 1138 [2018-09-26 08:06:42,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-09-26 08:06:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 705. [2018-09-26 08:06:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-09-26 08:06:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 3157 transitions. [2018-09-26 08:06:43,391 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 3157 transitions. Word has length 6 [2018-09-26 08:06:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,391 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 3157 transitions. [2018-09-26 08:06:43,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 3157 transitions. [2018-09-26 08:06:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:43,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,393 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 914033756, now seen corresponding path program 1 times [2018-09-26 08:06:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,419 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:43,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:43,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:43,420 INFO L87 Difference]: Start difference. First operand 705 states and 3157 transitions. Second operand 7 states. [2018-09-26 08:06:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,532 INFO L93 Difference]: Finished difference Result 1069 states and 4536 transitions. [2018-09-26 08:06:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:44,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,535 INFO L225 Difference]: With dead ends: 1069 [2018-09-26 08:06:44,536 INFO L226 Difference]: Without dead ends: 1063 [2018-09-26 08:06:44,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-26 08:06:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 699. [2018-09-26 08:06:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-09-26 08:06:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 3128 transitions. [2018-09-26 08:06:44,936 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 3128 transitions. Word has length 6 [2018-09-26 08:06:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,936 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 3128 transitions. [2018-09-26 08:06:44,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 3128 transitions. [2018-09-26 08:06:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:44,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:44,937 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash 914022475, now seen corresponding path program 1 times [2018-09-26 08:06:44,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:44,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:44,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:44,960 INFO L87 Difference]: Start difference. First operand 699 states and 3128 transitions. Second operand 7 states. [2018-09-26 08:06:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,336 INFO L93 Difference]: Finished difference Result 1187 states and 5015 transitions. [2018-09-26 08:06:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:46,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,343 INFO L225 Difference]: With dead ends: 1187 [2018-09-26 08:06:46,343 INFO L226 Difference]: Without dead ends: 1181 [2018-09-26 08:06:46,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-09-26 08:06:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 711. [2018-09-26 08:06:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-09-26 08:06:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 3183 transitions. [2018-09-26 08:06:46,781 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 3183 transitions. Word has length 6 [2018-09-26 08:06:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,781 INFO L480 AbstractCegarLoop]: Abstraction has 711 states and 3183 transitions. [2018-09-26 08:06:46,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 3183 transitions. [2018-09-26 08:06:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:46,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,782 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 914022348, now seen corresponding path program 1 times [2018-09-26 08:06:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:46,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:46,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:46,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:46,800 INFO L87 Difference]: Start difference. First operand 711 states and 3183 transitions. Second operand 7 states. [2018-09-26 08:06:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,701 INFO L93 Difference]: Finished difference Result 1122 states and 4765 transitions. [2018-09-26 08:06:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:47,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,705 INFO L225 Difference]: With dead ends: 1122 [2018-09-26 08:06:47,705 INFO L226 Difference]: Without dead ends: 1116 [2018-09-26 08:06:47,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-09-26 08:06:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 697. [2018-09-26 08:06:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-09-26 08:06:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 3116 transitions. [2018-09-26 08:06:48,162 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 3116 transitions. Word has length 6 [2018-09-26 08:06:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:48,162 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 3116 transitions. [2018-09-26 08:06:48,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 3116 transitions. [2018-09-26 08:06:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:48,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:48,163 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:06:48,164 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:48,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 914069320, now seen corresponding path program 1 times [2018-09-26 08:06:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:48,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:48,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:48,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:48,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:48,170 INFO L87 Difference]: Start difference. First operand 697 states and 3116 transitions. Second operand 4 states. [2018-09-26 08:06:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:48,583 INFO L93 Difference]: Finished difference Result 1197 states and 5195 transitions. [2018-09-26 08:06:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:48,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:06:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:48,586 INFO L225 Difference]: With dead ends: 1197 [2018-09-26 08:06:48,586 INFO L226 Difference]: Without dead ends: 869 [2018-09-26 08:06:48,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-09-26 08:06:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 671. [2018-09-26 08:06:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-26 08:06:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2941 transitions. [2018-09-26 08:06:48,928 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2941 transitions. Word has length 6 [2018-09-26 08:06:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:48,929 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2941 transitions. [2018-09-26 08:06:48,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2941 transitions. [2018-09-26 08:06:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:48,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:48,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:48,930 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:48,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 914072468, now seen corresponding path program 1 times [2018-09-26 08:06:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:48,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:48,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:48,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:48,940 INFO L87 Difference]: Start difference. First operand 671 states and 2941 transitions. Second operand 7 states. [2018-09-26 08:06:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,667 INFO L93 Difference]: Finished difference Result 1201 states and 4932 transitions. [2018-09-26 08:06:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:49,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,670 INFO L225 Difference]: With dead ends: 1201 [2018-09-26 08:06:49,670 INFO L226 Difference]: Without dead ends: 1195 [2018-09-26 08:06:49,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-09-26 08:06:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 752. [2018-09-26 08:06:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-09-26 08:06:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 3312 transitions. [2018-09-26 08:06:50,082 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 3312 transitions. Word has length 6 [2018-09-26 08:06:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,083 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 3312 transitions. [2018-09-26 08:06:50,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 3312 transitions. [2018-09-26 08:06:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:50,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,083 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:50,084 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash 914072471, now seen corresponding path program 1 times [2018-09-26 08:06:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:50,096 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:50,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:50,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:50,097 INFO L87 Difference]: Start difference. First operand 752 states and 3312 transitions. Second operand 7 states. [2018-09-26 08:06:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,026 INFO L93 Difference]: Finished difference Result 1250 states and 5213 transitions. [2018-09-26 08:06:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:51,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,029 INFO L225 Difference]: With dead ends: 1250 [2018-09-26 08:06:51,029 INFO L226 Difference]: Without dead ends: 1244 [2018-09-26 08:06:51,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-09-26 08:06:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 825. [2018-09-26 08:06:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-09-26 08:06:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 3616 transitions. [2018-09-26 08:06:51,458 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 3616 transitions. Word has length 6 [2018-09-26 08:06:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:51,459 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 3616 transitions. [2018-09-26 08:06:51,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 3616 transitions. [2018-09-26 08:06:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:51,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:51,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:51,460 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:51,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 914569284, now seen corresponding path program 1 times [2018-09-26 08:06:51,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:51,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:51,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:51,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:51,475 INFO L87 Difference]: Start difference. First operand 825 states and 3616 transitions. Second operand 7 states. [2018-09-26 08:06:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:52,552 INFO L93 Difference]: Finished difference Result 1256 states and 5269 transitions. [2018-09-26 08:06:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:52,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:52,556 INFO L225 Difference]: With dead ends: 1256 [2018-09-26 08:06:52,557 INFO L226 Difference]: Without dead ends: 1250 [2018-09-26 08:06:52,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-09-26 08:06:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 857. [2018-09-26 08:06:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-09-26 08:06:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 3741 transitions. [2018-09-26 08:06:53,087 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 3741 transitions. Word has length 6 [2018-09-26 08:06:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:53,087 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 3741 transitions. [2018-09-26 08:06:53,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 3741 transitions. [2018-09-26 08:06:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:53,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:53,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:53,088 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:53,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash 914569157, now seen corresponding path program 1 times [2018-09-26 08:06:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:53,100 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:53,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:53,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:53,101 INFO L87 Difference]: Start difference. First operand 857 states and 3741 transitions. Second operand 7 states. [2018-09-26 08:06:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,041 INFO L93 Difference]: Finished difference Result 1225 states and 5152 transitions. [2018-09-26 08:06:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:54,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,044 INFO L225 Difference]: With dead ends: 1225 [2018-09-26 08:06:54,044 INFO L226 Difference]: Without dead ends: 1219 [2018-09-26 08:06:54,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-26 08:06:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 849. [2018-09-26 08:06:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-26 08:06:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 3706 transitions. [2018-09-26 08:06:54,523 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 3706 transitions. Word has length 6 [2018-09-26 08:06:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:54,524 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 3706 transitions. [2018-09-26 08:06:54,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 3706 transitions. [2018-09-26 08:06:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:54,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:54,525 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash 913940811, now seen corresponding path program 1 times [2018-09-26 08:06:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:54,538 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:54,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:54,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:54,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:54,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:54,539 INFO L87 Difference]: Start difference. First operand 849 states and 3706 transitions. Second operand 7 states. [2018-09-26 08:06:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,480 INFO L93 Difference]: Finished difference Result 1442 states and 5955 transitions. [2018-09-26 08:06:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:55,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,485 INFO L225 Difference]: With dead ends: 1442 [2018-09-26 08:06:55,485 INFO L226 Difference]: Without dead ends: 1436 [2018-09-26 08:06:55,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-09-26 08:06:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 905. [2018-09-26 08:06:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-09-26 08:06:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3981 transitions. [2018-09-26 08:06:55,993 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3981 transitions. Word has length 6 [2018-09-26 08:06:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,993 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 3981 transitions. [2018-09-26 08:06:55,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3981 transitions. [2018-09-26 08:06:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:55,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:55,994 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 913940814, now seen corresponding path program 1 times [2018-09-26 08:06:55,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:56,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:56,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:56,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:56,010 INFO L87 Difference]: Start difference. First operand 905 states and 3981 transitions. Second operand 7 states. [2018-09-26 08:06:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,132 INFO L93 Difference]: Finished difference Result 1440 states and 5977 transitions. [2018-09-26 08:06:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:57,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,136 INFO L225 Difference]: With dead ends: 1440 [2018-09-26 08:06:57,136 INFO L226 Difference]: Without dead ends: 1434 [2018-09-26 08:06:57,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2018-09-26 08:06:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 889. [2018-09-26 08:06:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-09-26 08:06:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3911 transitions. [2018-09-26 08:06:57,759 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3911 transitions. Word has length 6 [2018-09-26 08:06:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 3911 transitions. [2018-09-26 08:06:57,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3911 transitions. [2018-09-26 08:06:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:57,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,761 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash 913927853, now seen corresponding path program 1 times [2018-09-26 08:06:57,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:57,778 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:57,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:57,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:57,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:57,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:57,779 INFO L87 Difference]: Start difference. First operand 889 states and 3911 transitions. Second operand 7 states. [2018-09-26 08:06:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,746 INFO L93 Difference]: Finished difference Result 1361 states and 5672 transitions. [2018-09-26 08:06:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:58,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,749 INFO L225 Difference]: With dead ends: 1361 [2018-09-26 08:06:58,749 INFO L226 Difference]: Without dead ends: 1355 [2018-09-26 08:06:58,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-09-26 08:06:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 900. [2018-09-26 08:06:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-09-26 08:06:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 3963 transitions. [2018-09-26 08:06:59,286 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 3963 transitions. Word has length 6 [2018-09-26 08:06:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,286 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 3963 transitions. [2018-09-26 08:06:59,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 3963 transitions. [2018-09-26 08:06:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:59,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,287 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,287 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 913927856, now seen corresponding path program 1 times [2018-09-26 08:06:59,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:59,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:59,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,313 INFO L87 Difference]: Start difference. First operand 900 states and 3963 transitions. Second operand 7 states. [2018-09-26 08:07:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,514 INFO L93 Difference]: Finished difference Result 1349 states and 5655 transitions. [2018-09-26 08:07:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:00,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:07:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,518 INFO L225 Difference]: With dead ends: 1349 [2018-09-26 08:07:00,518 INFO L226 Difference]: Without dead ends: 1343 [2018-09-26 08:07:00,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-09-26 08:07:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 896. [2018-09-26 08:07:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-26 08:07:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3945 transitions. [2018-09-26 08:07:01,142 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 3945 transitions. Word has length 6 [2018-09-26 08:07:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,142 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 3945 transitions. [2018-09-26 08:07:01,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 3945 transitions. [2018-09-26 08:07:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:01,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:01,143 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1215232670, now seen corresponding path program 1 times [2018-09-26 08:07:01,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:01,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:01,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:01,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:01,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:01,159 INFO L87 Difference]: Start difference. First operand 896 states and 3945 transitions. Second operand 8 states. [2018-09-26 08:07:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,583 INFO L93 Difference]: Finished difference Result 1632 states and 6899 transitions. [2018-09-26 08:07:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:02,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,587 INFO L225 Difference]: With dead ends: 1632 [2018-09-26 08:07:02,587 INFO L226 Difference]: Without dead ends: 1626 [2018-09-26 08:07:02,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-09-26 08:07:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1177. [2018-09-26 08:07:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-09-26 08:07:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 5230 transitions. [2018-09-26 08:07:03,327 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 5230 transitions. Word has length 7 [2018-09-26 08:07:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,328 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 5230 transitions. [2018-09-26 08:07:03,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 5230 transitions. [2018-09-26 08:07:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:03,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,329 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,329 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1215233045, now seen corresponding path program 1 times [2018-09-26 08:07:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,342 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:03,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:03,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:03,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:03,343 INFO L87 Difference]: Start difference. First operand 1177 states and 5230 transitions. Second operand 8 states. [2018-09-26 08:07:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,414 INFO L93 Difference]: Finished difference Result 1376 states and 5845 transitions. [2018-09-26 08:07:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:04,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,418 INFO L225 Difference]: With dead ends: 1376 [2018-09-26 08:07:04,418 INFO L226 Difference]: Without dead ends: 1370 [2018-09-26 08:07:04,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-09-26 08:07:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1171. [2018-09-26 08:07:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-09-26 08:07:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 5199 transitions. [2018-09-26 08:07:05,290 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 5199 transitions. Word has length 7 [2018-09-26 08:07:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,291 INFO L480 AbstractCegarLoop]: Abstraction has 1171 states and 5199 transitions. [2018-09-26 08:07:05,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 5199 transitions. [2018-09-26 08:07:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:05,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,292 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1202921392, now seen corresponding path program 1 times [2018-09-26 08:07:05,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:05,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:05,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:05,303 INFO L87 Difference]: Start difference. First operand 1171 states and 5199 transitions. Second operand 8 states. [2018-09-26 08:07:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,611 INFO L93 Difference]: Finished difference Result 1643 states and 7055 transitions. [2018-09-26 08:07:06,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:06,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,615 INFO L225 Difference]: With dead ends: 1643 [2018-09-26 08:07:06,616 INFO L226 Difference]: Without dead ends: 1637 [2018-09-26 08:07:06,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-09-26 08:07:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1203. [2018-09-26 08:07:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2018-09-26 08:07:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 5375 transitions. [2018-09-26 08:07:07,485 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 5375 transitions. Word has length 7 [2018-09-26 08:07:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,486 INFO L480 AbstractCegarLoop]: Abstraction has 1203 states and 5375 transitions. [2018-09-26 08:07:07,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 5375 transitions. [2018-09-26 08:07:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:07,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:07,488 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1202921767, now seen corresponding path program 1 times [2018-09-26 08:07:07,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,498 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:07,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:07,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:07,498 INFO L87 Difference]: Start difference. First operand 1203 states and 5375 transitions. Second operand 8 states. [2018-09-26 08:07:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,851 INFO L93 Difference]: Finished difference Result 1627 states and 7002 transitions. [2018-09-26 08:07:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:08,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,855 INFO L225 Difference]: With dead ends: 1627 [2018-09-26 08:07:08,855 INFO L226 Difference]: Without dead ends: 1621 [2018-09-26 08:07:08,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2018-09-26 08:07:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1282. [2018-09-26 08:07:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-09-26 08:07:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 5742 transitions. [2018-09-26 08:07:09,745 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 5742 transitions. Word has length 7 [2018-09-26 08:07:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,745 INFO L480 AbstractCegarLoop]: Abstraction has 1282 states and 5742 transitions. [2018-09-26 08:07:09,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 5742 transitions. [2018-09-26 08:07:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:09,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,746 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1202932831, now seen corresponding path program 1 times [2018-09-26 08:07:09,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:09,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:09,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:09,755 INFO L87 Difference]: Start difference. First operand 1282 states and 5742 transitions. Second operand 8 states. [2018-09-26 08:07:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,271 INFO L93 Difference]: Finished difference Result 1692 states and 7228 transitions. [2018-09-26 08:07:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:11,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,276 INFO L225 Difference]: With dead ends: 1692 [2018-09-26 08:07:11,276 INFO L226 Difference]: Without dead ends: 1686 [2018-09-26 08:07:11,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2018-09-26 08:07:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1244. [2018-09-26 08:07:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-09-26 08:07:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 5541 transitions. [2018-09-26 08:07:12,292 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 5541 transitions. Word has length 7 [2018-09-26 08:07:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,292 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 5541 transitions. [2018-09-26 08:07:12,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 5541 transitions. [2018-09-26 08:07:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:12,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:12,294 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1202933206, now seen corresponding path program 1 times [2018-09-26 08:07:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:12,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:12,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:12,302 INFO L87 Difference]: Start difference. First operand 1244 states and 5541 transitions. Second operand 8 states. [2018-09-26 08:07:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,133 INFO L93 Difference]: Finished difference Result 1668 states and 7135 transitions. [2018-09-26 08:07:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:14,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,137 INFO L225 Difference]: With dead ends: 1668 [2018-09-26 08:07:14,137 INFO L226 Difference]: Without dead ends: 1666 [2018-09-26 08:07:14,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-09-26 08:07:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1223. [2018-09-26 08:07:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-09-26 08:07:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 5442 transitions. [2018-09-26 08:07:15,128 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 5442 transitions. Word has length 7 [2018-09-26 08:07:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,128 INFO L480 AbstractCegarLoop]: Abstraction has 1223 states and 5442 transitions. [2018-09-26 08:07:15,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 5442 transitions. [2018-09-26 08:07:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:15,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:15,129 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1245822743, now seen corresponding path program 1 times [2018-09-26 08:07:15,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:15,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:15,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:15,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:15,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:15,140 INFO L87 Difference]: Start difference. First operand 1223 states and 5442 transitions. Second operand 8 states. [2018-09-26 08:07:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,356 INFO L93 Difference]: Finished difference Result 1979 states and 8650 transitions. [2018-09-26 08:07:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:16,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,361 INFO L225 Difference]: With dead ends: 1979 [2018-09-26 08:07:16,361 INFO L226 Difference]: Without dead ends: 1562 [2018-09-26 08:07:16,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-09-26 08:07:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1266. [2018-09-26 08:07:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-26 08:07:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 5570 transitions. [2018-09-26 08:07:17,239 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 5570 transitions. Word has length 7 [2018-09-26 08:07:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,239 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 5570 transitions. [2018-09-26 08:07:17,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 5570 transitions. [2018-09-26 08:07:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:17,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:17,240 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1245822746, now seen corresponding path program 1 times [2018-09-26 08:07:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:17,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:17,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:17,251 INFO L87 Difference]: Start difference. First operand 1266 states and 5570 transitions. Second operand 8 states. [2018-09-26 08:07:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,809 INFO L93 Difference]: Finished difference Result 1823 states and 7865 transitions. [2018-09-26 08:07:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:18,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,813 INFO L225 Difference]: With dead ends: 1823 [2018-09-26 08:07:18,813 INFO L226 Difference]: Without dead ends: 1817 [2018-09-26 08:07:18,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-09-26 08:07:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1390. [2018-09-26 08:07:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-09-26 08:07:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 6137 transitions. [2018-09-26 08:07:19,895 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 6137 transitions. Word has length 7 [2018-09-26 08:07:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,895 INFO L480 AbstractCegarLoop]: Abstraction has 1390 states and 6137 transitions. [2018-09-26 08:07:19,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 6137 transitions. [2018-09-26 08:07:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:19,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:19,897 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1258459411, now seen corresponding path program 1 times [2018-09-26 08:07:19,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,910 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:19,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:19,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:19,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:19,911 INFO L87 Difference]: Start difference. First operand 1390 states and 6137 transitions. Second operand 8 states. [2018-09-26 08:07:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,566 INFO L93 Difference]: Finished difference Result 1838 states and 7765 transitions. [2018-09-26 08:07:21,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:21,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,570 INFO L225 Difference]: With dead ends: 1838 [2018-09-26 08:07:21,571 INFO L226 Difference]: Without dead ends: 1832 [2018-09-26 08:07:21,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2018-09-26 08:07:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1163. [2018-09-26 08:07:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-09-26 08:07:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 5098 transitions. [2018-09-26 08:07:22,451 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 5098 transitions. Word has length 7 [2018-09-26 08:07:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,452 INFO L480 AbstractCegarLoop]: Abstraction has 1163 states and 5098 transitions. [2018-09-26 08:07:22,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 5098 transitions. [2018-09-26 08:07:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:22,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:22,453 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1258459786, now seen corresponding path program 1 times [2018-09-26 08:07:22,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,469 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:22,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:22,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:22,469 INFO L87 Difference]: Start difference. First operand 1163 states and 5098 transitions. Second operand 8 states. [2018-09-26 08:07:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,940 INFO L93 Difference]: Finished difference Result 1536 states and 6478 transitions. [2018-09-26 08:07:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:23,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,944 INFO L225 Difference]: With dead ends: 1536 [2018-09-26 08:07:23,944 INFO L226 Difference]: Without dead ends: 1530 [2018-09-26 08:07:23,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2018-09-26 08:07:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1072. [2018-09-26 08:07:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-09-26 08:07:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 4678 transitions. [2018-09-26 08:07:24,788 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 4678 transitions. Word has length 7 [2018-09-26 08:07:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,788 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 4678 transitions. [2018-09-26 08:07:24,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 4678 transitions. [2018-09-26 08:07:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:24,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,790 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 792850588, now seen corresponding path program 1 times [2018-09-26 08:07:24,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,798 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:24,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:24,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:24,799 INFO L87 Difference]: Start difference. First operand 1072 states and 4678 transitions. Second operand 8 states. [2018-09-26 08:07:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,351 INFO L93 Difference]: Finished difference Result 1630 states and 6984 transitions. [2018-09-26 08:07:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:26,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,355 INFO L225 Difference]: With dead ends: 1630 [2018-09-26 08:07:26,355 INFO L226 Difference]: Without dead ends: 1618 [2018-09-26 08:07:26,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2018-09-26 08:07:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1182. [2018-09-26 08:07:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-09-26 08:07:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 5237 transitions. [2018-09-26 08:07:27,323 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 5237 transitions. Word has length 7 [2018-09-26 08:07:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,323 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 5237 transitions. [2018-09-26 08:07:27,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 5237 transitions. [2018-09-26 08:07:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:27,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:27,324 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash 792058662, now seen corresponding path program 1 times [2018-09-26 08:07:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:27,335 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:27,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:27,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:27,336 INFO L87 Difference]: Start difference. First operand 1182 states and 5237 transitions. Second operand 8 states. [2018-09-26 08:07:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,995 INFO L93 Difference]: Finished difference Result 1554 states and 6632 transitions. [2018-09-26 08:07:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:28,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,999 INFO L225 Difference]: With dead ends: 1554 [2018-09-26 08:07:28,999 INFO L226 Difference]: Without dead ends: 1548 [2018-09-26 08:07:29,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2018-09-26 08:07:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1166. [2018-09-26 08:07:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-09-26 08:07:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 5153 transitions. [2018-09-26 08:07:29,975 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 5153 transitions. Word has length 7 [2018-09-26 08:07:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,975 INFO L480 AbstractCegarLoop]: Abstraction has 1166 states and 5153 transitions. [2018-09-26 08:07:29,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 5153 transitions. [2018-09-26 08:07:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:29,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:29,976 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 792058665, now seen corresponding path program 1 times [2018-09-26 08:07:29,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,986 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:29,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:29,986 INFO L87 Difference]: Start difference. First operand 1166 states and 5153 transitions. Second operand 8 states. [2018-09-26 08:07:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,914 INFO L93 Difference]: Finished difference Result 1766 states and 7491 transitions. [2018-09-26 08:07:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:31,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,919 INFO L225 Difference]: With dead ends: 1766 [2018-09-26 08:07:31,919 INFO L226 Difference]: Without dead ends: 1764 [2018-09-26 08:07:31,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-26 08:07:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1149. [2018-09-26 08:07:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-09-26 08:07:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 5076 transitions. [2018-09-26 08:07:32,918 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 5076 transitions. Word has length 7 [2018-09-26 08:07:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:32,918 INFO L480 AbstractCegarLoop]: Abstraction has 1149 states and 5076 transitions. [2018-09-26 08:07:32,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 5076 transitions. [2018-09-26 08:07:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:32,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:32,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:32,920 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:32,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 792055841, now seen corresponding path program 1 times [2018-09-26 08:07:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:32,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:32,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:32,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:32,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:32,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:32,931 INFO L87 Difference]: Start difference. First operand 1149 states and 5076 transitions. Second operand 8 states. [2018-09-26 08:07:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,078 INFO L93 Difference]: Finished difference Result 1832 states and 7818 transitions. [2018-09-26 08:07:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:35,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,082 INFO L225 Difference]: With dead ends: 1832 [2018-09-26 08:07:35,083 INFO L226 Difference]: Without dead ends: 1826 [2018-09-26 08:07:35,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-09-26 08:07:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1154. [2018-09-26 08:07:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2018-09-26 08:07:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 5098 transitions. [2018-09-26 08:07:36,091 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 5098 transitions. Word has length 7 [2018-09-26 08:07:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:36,091 INFO L480 AbstractCegarLoop]: Abstraction has 1154 states and 5098 transitions. [2018-09-26 08:07:36,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 5098 transitions. [2018-09-26 08:07:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:36,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:36,092 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:36,092 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:36,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash 792055844, now seen corresponding path program 1 times [2018-09-26 08:07:36,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:36,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:36,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:36,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:36,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:36,107 INFO L87 Difference]: Start difference. First operand 1154 states and 5098 transitions. Second operand 8 states. [2018-09-26 08:07:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:38,123 INFO L93 Difference]: Finished difference Result 1820 states and 7670 transitions. [2018-09-26 08:07:38,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:38,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:38,128 INFO L225 Difference]: With dead ends: 1820 [2018-09-26 08:07:38,128 INFO L226 Difference]: Without dead ends: 1814 [2018-09-26 08:07:38,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2018-09-26 08:07:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1048. [2018-09-26 08:07:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-09-26 08:07:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 4552 transitions. [2018-09-26 08:07:39,180 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 4552 transitions. Word has length 7 [2018-09-26 08:07:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,180 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 4552 transitions. [2018-09-26 08:07:39,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 4552 transitions. [2018-09-26 08:07:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:39,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:39,182 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1734683267, now seen corresponding path program 1 times [2018-09-26 08:07:39,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:39,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:39,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:39,199 INFO L87 Difference]: Start difference. First operand 1048 states and 4552 transitions. Second operand 8 states. [2018-09-26 08:07:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:41,349 INFO L93 Difference]: Finished difference Result 1741 states and 7174 transitions. [2018-09-26 08:07:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:41,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:41,353 INFO L225 Difference]: With dead ends: 1741 [2018-09-26 08:07:41,353 INFO L226 Difference]: Without dead ends: 1735 [2018-09-26 08:07:41,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-09-26 08:07:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1077. [2018-09-26 08:07:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2018-09-26 08:07:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 4692 transitions. [2018-09-26 08:07:42,385 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 4692 transitions. Word has length 7 [2018-09-26 08:07:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:42,385 INFO L480 AbstractCegarLoop]: Abstraction has 1077 states and 4692 transitions. [2018-09-26 08:07:42,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 4692 transitions. [2018-09-26 08:07:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:42,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:42,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:42,386 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:42,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682892, now seen corresponding path program 1 times [2018-09-26 08:07:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:42,413 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:42,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:42,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:42,414 INFO L87 Difference]: Start difference. First operand 1077 states and 4692 transitions. Second operand 8 states. [2018-09-26 08:07:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:45,437 INFO L93 Difference]: Finished difference Result 1734 states and 7201 transitions. [2018-09-26 08:07:45,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:45,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:45,441 INFO L225 Difference]: With dead ends: 1734 [2018-09-26 08:07:45,441 INFO L226 Difference]: Without dead ends: 1728 [2018-09-26 08:07:45,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-09-26 08:07:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1068. [2018-09-26 08:07:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-09-26 08:07:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 4655 transitions. [2018-09-26 08:07:46,497 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 4655 transitions. Word has length 7 [2018-09-26 08:07:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:46,497 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 4655 transitions. [2018-09-26 08:07:46,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 4655 transitions. [2018-09-26 08:07:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:46,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:46,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:46,499 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:46,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1734671828, now seen corresponding path program 1 times [2018-09-26 08:07:46,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:46,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:46,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:46,520 INFO L87 Difference]: Start difference. First operand 1068 states and 4655 transitions. Second operand 8 states. [2018-09-26 08:07:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:48,758 INFO L93 Difference]: Finished difference Result 1680 states and 6963 transitions. [2018-09-26 08:07:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:48,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:48,762 INFO L225 Difference]: With dead ends: 1680 [2018-09-26 08:07:48,762 INFO L226 Difference]: Without dead ends: 1674 [2018-09-26 08:07:48,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-09-26 08:07:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1058. [2018-09-26 08:07:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-09-26 08:07:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 4600 transitions. [2018-09-26 08:07:49,841 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 4600 transitions. Word has length 7 [2018-09-26 08:07:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:49,841 INFO L480 AbstractCegarLoop]: Abstraction has 1058 states and 4600 transitions. [2018-09-26 08:07:49,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 4600 transitions. [2018-09-26 08:07:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:49,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:49,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:49,843 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:49,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1734671453, now seen corresponding path program 1 times [2018-09-26 08:07:49,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:49,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:49,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:49,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:49,864 INFO L87 Difference]: Start difference. First operand 1058 states and 4600 transitions. Second operand 8 states. [2018-09-26 08:07:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:52,414 INFO L93 Difference]: Finished difference Result 1693 states and 7034 transitions. [2018-09-26 08:07:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:52,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:52,418 INFO L225 Difference]: With dead ends: 1693 [2018-09-26 08:07:52,419 INFO L226 Difference]: Without dead ends: 1691 [2018-09-26 08:07:52,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-09-26 08:07:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1025. [2018-09-26 08:07:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-09-26 08:07:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4437 transitions. [2018-09-26 08:07:53,494 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4437 transitions. Word has length 7 [2018-09-26 08:07:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:53,495 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 4437 transitions. [2018-09-26 08:07:53,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4437 transitions. [2018-09-26 08:07:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:53,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:53,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:53,496 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:53,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1730207890, now seen corresponding path program 1 times [2018-09-26 08:07:53,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:53,507 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:53,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:53,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:53,507 INFO L87 Difference]: Start difference. First operand 1025 states and 4437 transitions. Second operand 8 states. [2018-09-26 08:07:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:56,195 INFO L93 Difference]: Finished difference Result 1997 states and 8274 transitions. [2018-09-26 08:07:56,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:56,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:56,201 INFO L225 Difference]: With dead ends: 1997 [2018-09-26 08:07:56,201 INFO L226 Difference]: Without dead ends: 1991 [2018-09-26 08:07:56,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-09-26 08:07:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1089. [2018-09-26 08:07:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-26 08:07:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 4710 transitions. [2018-09-26 08:07:57,392 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 4710 transitions. Word has length 7 [2018-09-26 08:07:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:57,393 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 4710 transitions. [2018-09-26 08:07:57,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 4710 transitions. [2018-09-26 08:07:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:07:57,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:57,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:57,395 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:57,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1730207515, now seen corresponding path program 1 times [2018-09-26 08:07:57,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:57,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:57,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:07:57,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:57,408 INFO L87 Difference]: Start difference. First operand 1089 states and 4710 transitions. Second operand 8 states. [2018-09-26 08:07:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:59,545 INFO L93 Difference]: Finished difference Result 1637 states and 6902 transitions. [2018-09-26 08:07:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:59,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:07:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:59,549 INFO L225 Difference]: With dead ends: 1637 [2018-09-26 08:07:59,549 INFO L226 Difference]: Without dead ends: 1631 [2018-09-26 08:07:59,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-09-26 08:08:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1325. [2018-09-26 08:08:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-09-26 08:08:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 5776 transitions. [2018-09-26 08:08:01,002 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 5776 transitions. Word has length 7 [2018-09-26 08:08:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,003 INFO L480 AbstractCegarLoop]: Abstraction has 1325 states and 5776 transitions. [2018-09-26 08:08:01,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 5776 transitions. [2018-09-26 08:08:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:01,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:01,004 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1728542101, now seen corresponding path program 1 times [2018-09-26 08:08:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:01,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:01,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:01,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:01,015 INFO L87 Difference]: Start difference. First operand 1325 states and 5776 transitions. Second operand 8 states. [2018-09-26 08:08:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:03,301 INFO L93 Difference]: Finished difference Result 1882 states and 7972 transitions. [2018-09-26 08:08:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:08:03,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:03,305 INFO L225 Difference]: With dead ends: 1882 [2018-09-26 08:08:03,305 INFO L226 Difference]: Without dead ends: 1876 [2018-09-26 08:08:03,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:08:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-09-26 08:08:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1337. [2018-09-26 08:08:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-26 08:08:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 5824 transitions. [2018-09-26 08:08:04,803 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 5824 transitions. Word has length 7 [2018-09-26 08:08:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:04,804 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 5824 transitions. [2018-09-26 08:08:04,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 5824 transitions. [2018-09-26 08:08:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:04,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:04,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:04,805 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:04,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1728541990, now seen corresponding path program 1 times [2018-09-26 08:08:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:04,817 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:04,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:04,818 INFO L87 Difference]: Start difference. First operand 1337 states and 5824 transitions. Second operand 8 states. [2018-09-26 08:08:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:07,142 INFO L93 Difference]: Finished difference Result 1874 states and 7946 transitions. [2018-09-26 08:08:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:08:07,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:07,147 INFO L225 Difference]: With dead ends: 1874 [2018-09-26 08:08:07,147 INFO L226 Difference]: Without dead ends: 1868 [2018-09-26 08:08:07,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:08:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-09-26 08:08:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1328. [2018-09-26 08:08:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-09-26 08:08:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 5794 transitions. [2018-09-26 08:08:08,713 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 5794 transitions. Word has length 7 [2018-09-26 08:08:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:08,713 INFO L480 AbstractCegarLoop]: Abstraction has 1328 states and 5794 transitions. [2018-09-26 08:08:08,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 5794 transitions. [2018-09-26 08:08:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:08,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:08,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:08,715 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:08,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1713256811, now seen corresponding path program 1 times [2018-09-26 08:08:08,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,723 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:08,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:08,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:08,724 INFO L87 Difference]: Start difference. First operand 1328 states and 5794 transitions. Second operand 8 states. [2018-09-26 08:08:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:11,120 INFO L93 Difference]: Finished difference Result 1819 states and 7620 transitions. [2018-09-26 08:08:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:08:11,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:11,125 INFO L225 Difference]: With dead ends: 1819 [2018-09-26 08:08:11,125 INFO L226 Difference]: Without dead ends: 1813 [2018-09-26 08:08:11,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:08:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-09-26 08:08:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1326. [2018-09-26 08:08:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-09-26 08:08:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 5781 transitions. [2018-09-26 08:08:12,655 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 5781 transitions. Word has length 7 [2018-09-26 08:08:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:12,655 INFO L480 AbstractCegarLoop]: Abstraction has 1326 states and 5781 transitions. [2018-09-26 08:08:12,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 5781 transitions. [2018-09-26 08:08:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:12,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:12,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:12,657 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:12,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1713256436, now seen corresponding path program 1 times [2018-09-26 08:08:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:12,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:12,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:12,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:12,666 INFO L87 Difference]: Start difference. First operand 1326 states and 5781 transitions. Second operand 8 states. [2018-09-26 08:08:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:15,327 INFO L93 Difference]: Finished difference Result 1894 states and 7994 transitions. [2018-09-26 08:08:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:15,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:15,331 INFO L225 Difference]: With dead ends: 1894 [2018-09-26 08:08:15,331 INFO L226 Difference]: Without dead ends: 1888 [2018-09-26 08:08:15,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:08:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-09-26 08:08:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1224. [2018-09-26 08:08:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-09-26 08:08:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 5364 transitions. [2018-09-26 08:08:16,813 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 5364 transitions. Word has length 7 [2018-09-26 08:08:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:16,813 INFO L480 AbstractCegarLoop]: Abstraction has 1224 states and 5364 transitions. [2018-09-26 08:08:16,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 5364 transitions. [2018-09-26 08:08:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:16,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:16,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:16,815 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:16,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623468, now seen corresponding path program 1 times [2018-09-26 08:08:16,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:16,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:16,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:16,825 INFO L87 Difference]: Start difference. First operand 1224 states and 5364 transitions. Second operand 8 states. [2018-09-26 08:08:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:19,418 INFO L93 Difference]: Finished difference Result 1823 states and 7639 transitions. [2018-09-26 08:08:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:08:19,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:19,423 INFO L225 Difference]: With dead ends: 1823 [2018-09-26 08:08:19,423 INFO L226 Difference]: Without dead ends: 1817 [2018-09-26 08:08:19,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:08:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-09-26 08:08:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1235. [2018-09-26 08:08:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-09-26 08:08:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 5415 transitions. [2018-09-26 08:08:20,975 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 5415 transitions. Word has length 7 [2018-09-26 08:08:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:20,975 INFO L480 AbstractCegarLoop]: Abstraction has 1235 states and 5415 transitions. [2018-09-26 08:08:20,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 5415 transitions. [2018-09-26 08:08:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:20,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:20,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:20,976 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:20,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623357, now seen corresponding path program 1 times [2018-09-26 08:08:20,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:20,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:20,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:20,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:20,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:20,988 INFO L87 Difference]: Start difference. First operand 1235 states and 5415 transitions. Second operand 8 states. [2018-09-26 08:08:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:23,036 INFO L93 Difference]: Finished difference Result 1502 states and 6388 transitions. [2018-09-26 08:08:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:08:23,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:23,040 INFO L225 Difference]: With dead ends: 1502 [2018-09-26 08:08:23,041 INFO L226 Difference]: Without dead ends: 1496 [2018-09-26 08:08:23,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:08:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-09-26 08:08:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1178. [2018-09-26 08:08:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-09-26 08:08:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 5168 transitions. [2018-09-26 08:08:24,511 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 5168 transitions. Word has length 7 [2018-09-26 08:08:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:24,512 INFO L480 AbstractCegarLoop]: Abstraction has 1178 states and 5168 transitions. [2018-09-26 08:08:24,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 5168 transitions. [2018-09-26 08:08:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:24,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:24,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:24,513 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:24,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1733834669, now seen corresponding path program 1 times [2018-09-26 08:08:24,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:24,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:24,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:24,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:24,531 INFO L87 Difference]: Start difference. First operand 1178 states and 5168 transitions. Second operand 8 states. [2018-09-26 08:08:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:27,175 INFO L93 Difference]: Finished difference Result 1741 states and 7341 transitions. [2018-09-26 08:08:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:08:27,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:27,180 INFO L225 Difference]: With dead ends: 1741 [2018-09-26 08:08:27,180 INFO L226 Difference]: Without dead ends: 1735 [2018-09-26 08:08:27,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:08:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-09-26 08:08:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1153. [2018-09-26 08:08:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-26 08:08:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 5047 transitions. [2018-09-26 08:08:28,646 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 5047 transitions. Word has length 7 [2018-09-26 08:08:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:28,646 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 5047 transitions. [2018-09-26 08:08:28,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 5047 transitions. [2018-09-26 08:08:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:28,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:28,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:28,647 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:28,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1733834558, now seen corresponding path program 1 times [2018-09-26 08:08:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:28,663 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:28,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:28,664 INFO L87 Difference]: Start difference. First operand 1153 states and 5047 transitions. Second operand 8 states. [2018-09-26 08:08:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:31,409 INFO L93 Difference]: Finished difference Result 1712 states and 7222 transitions. [2018-09-26 08:08:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:08:31,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:31,413 INFO L225 Difference]: With dead ends: 1712 [2018-09-26 08:08:31,413 INFO L226 Difference]: Without dead ends: 1710 [2018-09-26 08:08:31,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:08:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-09-26 08:08:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1145. [2018-09-26 08:08:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-09-26 08:08:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 5012 transitions. [2018-09-26 08:08:32,889 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 5012 transitions. Word has length 7 [2018-09-26 08:08:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 1145 states and 5012 transitions. [2018-09-26 08:08:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 5012 transitions. [2018-09-26 08:08:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:32,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:32,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:32,890 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:32,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1733848743, now seen corresponding path program 1 times [2018-09-26 08:08:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:32,904 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:32,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:32,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:32,905 INFO L87 Difference]: Start difference. First operand 1145 states and 5012 transitions. Second operand 8 states. [2018-09-26 08:08:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:35,690 INFO L93 Difference]: Finished difference Result 1724 states and 7267 transitions. [2018-09-26 08:08:35,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:08:35,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:35,694 INFO L225 Difference]: With dead ends: 1724 [2018-09-26 08:08:35,694 INFO L226 Difference]: Without dead ends: 1722 [2018-09-26 08:08:35,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:08:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-09-26 08:08:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1145. [2018-09-26 08:08:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-09-26 08:08:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 5010 transitions. [2018-09-26 08:08:37,227 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 5010 transitions. Word has length 7 [2018-09-26 08:08:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:37,227 INFO L480 AbstractCegarLoop]: Abstraction has 1145 states and 5010 transitions. [2018-09-26 08:08:37,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 5010 transitions. [2018-09-26 08:08:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:08:37,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:37,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:37,228 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:37,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1733848632, now seen corresponding path program 1 times [2018-09-26 08:08:37,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:37,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:37,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:08:37,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:37,246 INFO L87 Difference]: Start difference. First operand 1145 states and 5010 transitions. Second operand 8 states. [2018-09-26 08:08:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:39,902 INFO L93 Difference]: Finished difference Result 1680 states and 7092 transitions. [2018-09-26 08:08:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:39,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:08:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:39,906 INFO L225 Difference]: With dead ends: 1680 [2018-09-26 08:08:39,906 INFO L226 Difference]: Without dead ends: 1674 [2018-09-26 08:08:39,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:08:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-09-26 08:08:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1057. [2018-09-26 08:08:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-09-26 08:08:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4579 transitions. [2018-09-26 08:08:41,367 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4579 transitions. Word has length 7 [2018-09-26 08:08:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:41,368 INFO L480 AbstractCegarLoop]: Abstraction has 1057 states and 4579 transitions. [2018-09-26 08:08:41,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4579 transitions. [2018-09-26 08:08:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:08:41,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:41,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:41,369 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:41,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash -969552830, now seen corresponding path program 1 times [2018-09-26 08:08:41,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:41,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:41,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:08:41,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:41,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:41,383 INFO L87 Difference]: Start difference. First operand 1057 states and 4579 transitions. Second operand 8 states. [2018-09-26 08:08:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:46,832 INFO L93 Difference]: Finished difference Result 3153 states and 12748 transitions. [2018-09-26 08:08:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:08:46,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:08:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:46,840 INFO L225 Difference]: With dead ends: 3153 [2018-09-26 08:08:46,840 INFO L226 Difference]: Without dead ends: 3144 [2018-09-26 08:08:46,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:08:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2018-09-26 08:08:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 1718. [2018-09-26 08:08:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-09-26 08:08:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 7792 transitions. [2018-09-26 08:08:49,378 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 7792 transitions. Word has length 8 [2018-09-26 08:08:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:49,378 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 7792 transitions. [2018-09-26 08:08:49,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 7792 transitions. [2018-09-26 08:08:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:08:49,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:49,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:49,380 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:49,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -969552827, now seen corresponding path program 1 times [2018-09-26 08:08:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:49,390 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:49,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:08:49,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:49,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:49,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:49,390 INFO L87 Difference]: Start difference. First operand 1718 states and 7792 transitions. Second operand 8 states. [2018-09-26 08:08:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:54,724 INFO L93 Difference]: Finished difference Result 3177 states and 12838 transitions. [2018-09-26 08:08:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:08:54,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:08:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:54,731 INFO L225 Difference]: With dead ends: 3177 [2018-09-26 08:08:54,731 INFO L226 Difference]: Without dead ends: 3168 [2018-09-26 08:08:54,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:08:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2018-09-26 08:08:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 1750. [2018-09-26 08:08:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-09-26 08:08:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 7931 transitions. [2018-09-26 08:08:57,279 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 7931 transitions. Word has length 8 [2018-09-26 08:08:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:57,279 INFO L480 AbstractCegarLoop]: Abstraction has 1750 states and 7931 transitions. [2018-09-26 08:08:57,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 7931 transitions. [2018-09-26 08:08:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:08:57,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:57,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:57,281 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:57,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -969552824, now seen corresponding path program 1 times [2018-09-26 08:08:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:57,291 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:08:57,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:08:57,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:57,292 INFO L87 Difference]: Start difference. First operand 1750 states and 7931 transitions. Second operand 8 states. [2018-09-26 08:09:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:03,026 INFO L93 Difference]: Finished difference Result 3626 states and 14920 transitions. [2018-09-26 08:09:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:09:03,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:09:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:03,035 INFO L225 Difference]: With dead ends: 3626 [2018-09-26 08:09:03,035 INFO L226 Difference]: Without dead ends: 3617 [2018-09-26 08:09:03,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:09:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2018-09-26 08:09:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 1819. [2018-09-26 08:09:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2018-09-26 08:09:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 8233 transitions. [2018-09-26 08:09:05,751 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 8233 transitions. Word has length 8 [2018-09-26 08:09:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:05,752 INFO L480 AbstractCegarLoop]: Abstraction has 1819 states and 8233 transitions. [2018-09-26 08:09:05,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:09:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 8233 transitions. [2018-09-26 08:09:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:09:05,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:05,753 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:05,753 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:05,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -982478745, now seen corresponding path program 1 times [2018-09-26 08:09:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:05,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:09:05,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:09:05,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:09:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:09:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:09:05,771 INFO L87 Difference]: Start difference. First operand 1819 states and 8233 transitions. Second operand 8 states. [2018-09-26 08:09:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:14,908 INFO L93 Difference]: Finished difference Result 4839 states and 19523 transitions. [2018-09-26 08:09:14,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:09:14,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:09:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:14,919 INFO L225 Difference]: With dead ends: 4839 [2018-09-26 08:09:14,919 INFO L226 Difference]: Without dead ends: 4830 [2018-09-26 08:09:14,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:09:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-09-26 08:09:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 1873. [2018-09-26 08:09:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2018-09-26 08:09:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 8515 transitions. [2018-09-26 08:09:17,767 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 8515 transitions. Word has length 8 [2018-09-26 08:09:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:17,767 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 8515 transitions. [2018-09-26 08:09:17,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:09:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 8515 transitions. [2018-09-26 08:09:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:09:17,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:17,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:17,769 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:17,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -982478742, now seen corresponding path program 1 times [2018-09-26 08:09:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:17,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:09:17,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:09:17,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:09:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:09:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:09:17,784 INFO L87 Difference]: Start difference. First operand 1873 states and 8515 transitions. Second operand 8 states. [2018-09-26 08:09:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:25,078 INFO L93 Difference]: Finished difference Result 4115 states and 16897 transitions. [2018-09-26 08:09:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:09:25,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:09:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:25,088 INFO L225 Difference]: With dead ends: 4115 [2018-09-26 08:09:25,088 INFO L226 Difference]: Without dead ends: 4106 [2018-09-26 08:09:25,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:09:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-09-26 08:09:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 1907. [2018-09-26 08:09:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2018-09-26 08:09:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 8653 transitions. [2018-09-26 08:09:28,083 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 8653 transitions. Word has length 8 [2018-09-26 08:09:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:28,083 INFO L480 AbstractCegarLoop]: Abstraction has 1907 states and 8653 transitions. [2018-09-26 08:09:28,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:09:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 8653 transitions. [2018-09-26 08:09:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:09:28,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:28,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:28,085 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:28,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash -982478739, now seen corresponding path program 1 times [2018-09-26 08:09:28,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:28,093 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:09:28,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:09:28,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:09:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:09:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:09:28,094 INFO L87 Difference]: Start difference. First operand 1907 states and 8653 transitions. Second operand 8 states. [2018-09-26 08:09:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:36,320 INFO L93 Difference]: Finished difference Result 4545 states and 18503 transitions. [2018-09-26 08:09:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:09:36,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:09:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:36,330 INFO L225 Difference]: With dead ends: 4545 [2018-09-26 08:09:36,331 INFO L226 Difference]: Without dead ends: 4536 [2018-09-26 08:09:36,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:09:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2018-09-26 08:09:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 2006. [2018-09-26 08:09:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2018-09-26 08:09:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 9153 transitions. [2018-09-26 08:09:39,532 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 9153 transitions. Word has length 8 [2018-09-26 08:09:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 9153 transitions. [2018-09-26 08:09:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:09:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 9153 transitions. [2018-09-26 08:09:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:09:39,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:39,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:39,533 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:39,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -982470592, now seen corresponding path program 1 times [2018-09-26 08:09:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:39,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-09-26 08:09:39,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:09:39,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:09:39,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:09:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:09:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:09:39,549 INFO L87 Difference]: Start difference. First operand 2006 states and 9153 transitions. Second operand 8 states. [2018-09-26 08:09:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:48,666 INFO L93 Difference]: Finished difference Result 4713 states and 19244 transitions. [2018-09-26 08:09:48,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:09:48,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:09:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:48,677 INFO L225 Difference]: With dead ends: 4713 [2018-09-26 08:09:48,677 INFO L226 Difference]: Without dead ends: 4704 [2018-09-26 08:09:48,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:09:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-09-26 08:09:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 2044. [2018-09-26 08:09:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-09-26 08:09:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 9327 transitions. [2018-09-26 08:09:52,038 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 9327 transitions. Word has length 8 [2018-09-26 08:09:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:52,039 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 9327 transitions. [2018-09-26 08:09:52,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:09:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 9327 transitions. [2018-09-26 08:09:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:09:52,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:52,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:52,040 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:52,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash -982470589, now seen corresponding path program 1 times [2018-09-26 08:09:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:52,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:09:52,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:09:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:09:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:09:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:09:52,050 INFO L87 Difference]: Start difference. First operand 2044 states and 9327 transitions. Second operand 8 states. [2018-09-26 08:10:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:00,750 INFO L93 Difference]: Finished difference Result 4499 states and 18655 transitions. [2018-09-26 08:10:00,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:10:00,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:10:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:00,762 INFO L225 Difference]: With dead ends: 4499 [2018-09-26 08:10:00,762 INFO L226 Difference]: Without dead ends: 4490 [2018-09-26 08:10:00,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-09-26 08:10:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 2041. [2018-09-26 08:10:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2018-09-26 08:10:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 9313 transitions. [2018-09-26 08:10:04,117 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 9313 transitions. Word has length 8 [2018-09-26 08:10:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 2041 states and 9313 transitions. [2018-09-26 08:10:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 9313 transitions. [2018-09-26 08:10:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:04,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:04,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:04,119 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash -982470586, now seen corresponding path program 1 times [2018-09-26 08:10:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:04,126 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:04,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:10:04,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:04,127 INFO L87 Difference]: Start difference. First operand 2041 states and 9313 transitions. Second operand 8 states. [2018-09-26 08:10:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:13,151 INFO L93 Difference]: Finished difference Result 4601 states and 18796 transitions. [2018-09-26 08:10:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:10:13,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:10:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:13,162 INFO L225 Difference]: With dead ends: 4601 [2018-09-26 08:10:13,163 INFO L226 Difference]: Without dead ends: 4598 [2018-09-26 08:10:13,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2018-09-26 08:10:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 2032. [2018-09-26 08:10:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2018-09-26 08:10:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 9272 transitions. [2018-09-26 08:10:16,554 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 9272 transitions. Word has length 8 [2018-09-26 08:10:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:16,554 INFO L480 AbstractCegarLoop]: Abstraction has 2032 states and 9272 transitions. [2018-09-26 08:10:16,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 9272 transitions. [2018-09-26 08:10:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:16,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:16,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:16,555 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:16,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash -967288714, now seen corresponding path program 1 times [2018-09-26 08:10:16,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:16,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:16,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:10:16,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:16,567 INFO L87 Difference]: Start difference. First operand 2032 states and 9272 transitions. Second operand 8 states. [2018-09-26 08:10:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:24,695 INFO L93 Difference]: Finished difference Result 3979 states and 16777 transitions. [2018-09-26 08:10:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:24,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:10:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:24,705 INFO L225 Difference]: With dead ends: 3979 [2018-09-26 08:10:24,705 INFO L226 Difference]: Without dead ends: 3970 [2018-09-26 08:10:24,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. Received shutdown request... [2018-09-26 08:10:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 2715. [2018-09-26 08:10:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-09-26 08:10:29,555 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:29,560 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:29,561 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:29 BoogieIcfgContainer [2018-09-26 08:10:29,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:29,561 INFO L168 Benchmark]: Toolchain (without parser) took 256884.20 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:29,563 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:29,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:29,564 INFO L168 Benchmark]: Boogie Preprocessor took 74.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:29,564 INFO L168 Benchmark]: RCFGBuilder took 622.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:29,565 INFO L168 Benchmark]: TraceAbstraction took 256132.60 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:29,568 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 622.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256132.60 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 256.0s OverallTime, 82 OverallIterations, 2 TraceHistogramMax, 174.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17978 SDtfs, 36260 SDslu, 26907 SDs, 0 SdLazy, 175667 SolverSat, 18183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1354 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2044occurred in iteration=79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 79.1s AutomataMinimizationTime, 82 MinimizatonAttempts, 48645 StatesRemovedByMinimization, 81 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 24002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 82 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-29-581.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-29-581.csv Completed graceful shutdown