java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:07:41,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:07:41,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:07:41,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:07:41,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:07:41,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:07:41,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:07:41,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:07:41,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:07:41,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:07:41,504 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:07:41,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:07:41,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:07:41,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:07:41,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:07:41,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:07:41,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:07:41,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:07:41,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:07:41,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:07:41,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:07:41,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:07:41,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:07:41,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:07:41,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:07:41,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:07:41,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:07:41,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:07:41,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:07:41,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:07:41,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:07:41,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:07:41,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:07:41,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:07:41,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:07:41,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:07:41,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:07:41,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:07:41,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:07:41,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:07:41,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:07:41,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:07:41,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:07:41,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:07:41,579 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:07:41,580 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:07:41,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2019-08-05 10:07:41,582 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2019-08-05 10:07:41,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:07:41,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:07:41,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:41,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:07:41,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:07:41,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,691 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:07:41,691 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:07:41,691 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:07:41,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:41,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:07:41,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:07:41,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:07:41,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... [2019-08-05 10:07:41,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:07:41,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:07:41,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:07:41,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:07:41,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:07:41,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-05 10:07:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-05 10:07:41,818 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-05 10:07:42,637 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-05 10:07:42,639 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:07:42,640 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:07:42,641 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:42 BoogieIcfgContainer [2019-08-05 10:07:42,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:07:42,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:07:42,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:07:42,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:07:42,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:41" (1/2) ... [2019-08-05 10:07:42,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d0445b and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:07:42, skipping insertion in model container [2019-08-05 10:07:42,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:42" (2/2) ... [2019-08-05 10:07:42,650 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2019-08-05 10:07:42,660 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:07:42,668 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-08-05 10:07:42,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-08-05 10:07:42,712 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:07:42,713 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:07:42,713 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:07:42,713 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:07:42,714 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:07:42,714 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:07:42,714 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:07:42,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:07:42,714 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:07:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-08-05 10:07:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:07:42,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:42,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:42,746 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2019-08-05 10:07:42,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:42,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:42,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:43,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:43,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:43,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:43,114 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2019-08-05 10:07:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:45,030 INFO L93 Difference]: Finished difference Result 158 states and 348 transitions. [2019-08-05 10:07:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:07:45,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:07:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:45,048 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:07:45,049 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:07:45,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:07:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2019-08-05 10:07:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:07:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2019-08-05 10:07:45,112 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2019-08-05 10:07:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:45,113 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2019-08-05 10:07:45,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2019-08-05 10:07:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:07:45,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:45,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:45,117 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2019-08-05 10:07:45,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:45,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:45,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:45,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:45,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:45,256 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2019-08-05 10:07:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:46,029 INFO L93 Difference]: Finished difference Result 183 states and 408 transitions. [2019-08-05 10:07:46,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:07:46,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:07:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:46,033 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:07:46,035 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:07:46,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:07:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2019-08-05 10:07:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:07:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2019-08-05 10:07:46,051 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2019-08-05 10:07:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:46,051 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2019-08-05 10:07:46,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2019-08-05 10:07:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:07:46,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:46,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:46,053 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2019-08-05 10:07:46,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:46,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:07:46,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:07:46,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:46,364 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2019-08-05 10:07:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:47,186 INFO L93 Difference]: Finished difference Result 222 states and 505 transitions. [2019-08-05 10:07:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:47,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:07:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:47,193 INFO L225 Difference]: With dead ends: 222 [2019-08-05 10:07:47,193 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:07:47,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:07:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2019-08-05 10:07:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:07:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 304 transitions. [2019-08-05 10:07:47,209 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 304 transitions. Word has length 9 [2019-08-05 10:07:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:47,210 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 304 transitions. [2019-08-05 10:07:47,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 304 transitions. [2019-08-05 10:07:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:07:47,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:47,211 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:47,212 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2019-08-05 10:07:47,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:47,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:07:47,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:47,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:47,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:07:47,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:47,383 INFO L87 Difference]: Start difference. First operand 138 states and 304 transitions. Second operand 7 states. [2019-08-05 10:07:47,820 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:07:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:48,356 INFO L93 Difference]: Finished difference Result 213 states and 479 transitions. [2019-08-05 10:07:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:48,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:07:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:48,359 INFO L225 Difference]: With dead ends: 213 [2019-08-05 10:07:48,360 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 10:07:48,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 10:07:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 159. [2019-08-05 10:07:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:07:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2019-08-05 10:07:48,373 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 9 [2019-08-05 10:07:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:48,373 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2019-08-05 10:07:48,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2019-08-05 10:07:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:48,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:48,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:48,375 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2019-08-05 10:07:48,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:48,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:48,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:48,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:48,468 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand 8 states. [2019-08-05 10:07:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:50,937 INFO L93 Difference]: Finished difference Result 798 states and 1815 transitions. [2019-08-05 10:07:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:07:50,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:07:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:50,948 INFO L225 Difference]: With dead ends: 798 [2019-08-05 10:07:50,948 INFO L226 Difference]: Without dead ends: 798 [2019-08-05 10:07:50,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:07:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-08-05 10:07:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 382. [2019-08-05 10:07:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 10:07:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 912 transitions. [2019-08-05 10:07:50,996 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 912 transitions. Word has length 12 [2019-08-05 10:07:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:50,997 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 912 transitions. [2019-08-05 10:07:50,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 912 transitions. [2019-08-05 10:07:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:51,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:51,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:51,005 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2019-08-05 10:07:51,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:51,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:51,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:51,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:51,112 INFO L87 Difference]: Start difference. First operand 382 states and 912 transitions. Second operand 8 states. [2019-08-05 10:07:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:55,760 INFO L93 Difference]: Finished difference Result 921 states and 2086 transitions. [2019-08-05 10:07:55,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:07:55,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:07:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:55,767 INFO L225 Difference]: With dead ends: 921 [2019-08-05 10:07:55,768 INFO L226 Difference]: Without dead ends: 921 [2019-08-05 10:07:55,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:07:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-08-05 10:07:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 388. [2019-08-05 10:07:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:07:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 924 transitions. [2019-08-05 10:07:55,785 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 924 transitions. Word has length 12 [2019-08-05 10:07:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:55,785 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 924 transitions. [2019-08-05 10:07:55,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 924 transitions. [2019-08-05 10:07:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:55,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:55,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:55,788 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2019-08-05 10:07:55,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:55,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:55,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:55,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:55,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:55,877 INFO L87 Difference]: Start difference. First operand 388 states and 924 transitions. Second operand 8 states. [2019-08-05 10:07:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:57,996 INFO L93 Difference]: Finished difference Result 817 states and 1840 transitions. [2019-08-05 10:07:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:07:57,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:07:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:58,002 INFO L225 Difference]: With dead ends: 817 [2019-08-05 10:07:58,003 INFO L226 Difference]: Without dead ends: 817 [2019-08-05 10:07:58,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:07:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-08-05 10:07:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 416. [2019-08-05 10:07:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-05 10:07:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1000 transitions. [2019-08-05 10:07:58,020 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1000 transitions. Word has length 12 [2019-08-05 10:07:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:58,020 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 1000 transitions. [2019-08-05 10:07:58,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1000 transitions. [2019-08-05 10:07:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:58,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:58,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:58,022 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2019-08-05 10:07:58,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:58,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:58,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:58,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:58,186 INFO L87 Difference]: Start difference. First operand 416 states and 1000 transitions. Second operand 8 states. [2019-08-05 10:07:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:59,768 INFO L93 Difference]: Finished difference Result 666 states and 1511 transitions. [2019-08-05 10:07:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:07:59,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:07:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:59,775 INFO L225 Difference]: With dead ends: 666 [2019-08-05 10:07:59,775 INFO L226 Difference]: Without dead ends: 666 [2019-08-05 10:07:59,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:07:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-08-05 10:07:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 422. [2019-08-05 10:07:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 10:07:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1004 transitions. [2019-08-05 10:07:59,787 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1004 transitions. Word has length 12 [2019-08-05 10:07:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:59,788 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 1004 transitions. [2019-08-05 10:07:59,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1004 transitions. [2019-08-05 10:07:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:59,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:59,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:59,790 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2019-08-05 10:07:59,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:59,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:59,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:59,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:59,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:59,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:59,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:59,889 INFO L87 Difference]: Start difference. First operand 422 states and 1004 transitions. Second operand 8 states. [2019-08-05 10:08:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:02,151 INFO L93 Difference]: Finished difference Result 1103 states and 2507 transitions. [2019-08-05 10:08:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:08:02,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:02,159 INFO L225 Difference]: With dead ends: 1103 [2019-08-05 10:08:02,159 INFO L226 Difference]: Without dead ends: 1103 [2019-08-05 10:08:02,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:08:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-08-05 10:08:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 434. [2019-08-05 10:08:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-05 10:08:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1032 transitions. [2019-08-05 10:08:02,175 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1032 transitions. Word has length 12 [2019-08-05 10:08:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:02,175 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 1032 transitions. [2019-08-05 10:08:02,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1032 transitions. [2019-08-05 10:08:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:02,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:02,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:02,177 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2019-08-05 10:08:02,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:02,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:02,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:02,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:02,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:02,296 INFO L87 Difference]: Start difference. First operand 434 states and 1032 transitions. Second operand 8 states. [2019-08-05 10:08:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:04,620 INFO L93 Difference]: Finished difference Result 1091 states and 2447 transitions. [2019-08-05 10:08:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:08:04,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:04,626 INFO L225 Difference]: With dead ends: 1091 [2019-08-05 10:08:04,627 INFO L226 Difference]: Without dead ends: 1091 [2019-08-05 10:08:04,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:08:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-08-05 10:08:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 462. [2019-08-05 10:08:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-05 10:08:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1108 transitions. [2019-08-05 10:08:04,645 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1108 transitions. Word has length 12 [2019-08-05 10:08:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:04,645 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1108 transitions. [2019-08-05 10:08:04,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1108 transitions. [2019-08-05 10:08:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:04,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:04,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:04,647 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2019-08-05 10:08:04,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:04,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:05,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:05,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:05,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:05,121 INFO L87 Difference]: Start difference. First operand 462 states and 1108 transitions. Second operand 8 states. [2019-08-05 10:08:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:06,783 INFO L93 Difference]: Finished difference Result 933 states and 2102 transitions. [2019-08-05 10:08:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:08:06,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:06,791 INFO L225 Difference]: With dead ends: 933 [2019-08-05 10:08:06,791 INFO L226 Difference]: Without dead ends: 933 [2019-08-05 10:08:06,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:08:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-08-05 10:08:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 428. [2019-08-05 10:08:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-05 10:08:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1020 transitions. [2019-08-05 10:08:06,803 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1020 transitions. Word has length 12 [2019-08-05 10:08:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:06,803 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 1020 transitions. [2019-08-05 10:08:06,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1020 transitions. [2019-08-05 10:08:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:06,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:06,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:06,805 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2019-08-05 10:08:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:06,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:06,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:06,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:06,920 INFO L87 Difference]: Start difference. First operand 428 states and 1020 transitions. Second operand 8 states. [2019-08-05 10:08:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:09,151 INFO L93 Difference]: Finished difference Result 1016 states and 2300 transitions. [2019-08-05 10:08:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:08:09,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:09,159 INFO L225 Difference]: With dead ends: 1016 [2019-08-05 10:08:09,159 INFO L226 Difference]: Without dead ends: 1016 [2019-08-05 10:08:09,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:08:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-05 10:08:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 474. [2019-08-05 10:08:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-05 10:08:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1152 transitions. [2019-08-05 10:08:09,171 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1152 transitions. Word has length 12 [2019-08-05 10:08:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:09,173 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 1152 transitions. [2019-08-05 10:08:09,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1152 transitions. [2019-08-05 10:08:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:09,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:09,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:09,174 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2019-08-05 10:08:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:09,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:09,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:09,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:09,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:09,275 INFO L87 Difference]: Start difference. First operand 474 states and 1152 transitions. Second operand 8 states. [2019-08-05 10:08:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:11,038 INFO L93 Difference]: Finished difference Result 919 states and 2083 transitions. [2019-08-05 10:08:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:08:11,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:11,043 INFO L225 Difference]: With dead ends: 919 [2019-08-05 10:08:11,044 INFO L226 Difference]: Without dead ends: 919 [2019-08-05 10:08:11,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-08-05 10:08:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 462. [2019-08-05 10:08:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-05 10:08:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1122 transitions. [2019-08-05 10:08:11,055 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1122 transitions. Word has length 12 [2019-08-05 10:08:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:11,055 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1122 transitions. [2019-08-05 10:08:11,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1122 transitions. [2019-08-05 10:08:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:11,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:11,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:11,057 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2019-08-05 10:08:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:11,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:11,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:11,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:11,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:11,147 INFO L87 Difference]: Start difference. First operand 462 states and 1122 transitions. Second operand 8 states. [2019-08-05 10:08:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:12,857 INFO L93 Difference]: Finished difference Result 945 states and 2174 transitions. [2019-08-05 10:08:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:08:12,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:12,862 INFO L225 Difference]: With dead ends: 945 [2019-08-05 10:08:12,862 INFO L226 Difference]: Without dead ends: 945 [2019-08-05 10:08:12,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:08:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-08-05 10:08:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 483. [2019-08-05 10:08:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-08-05 10:08:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1177 transitions. [2019-08-05 10:08:12,873 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1177 transitions. Word has length 12 [2019-08-05 10:08:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:12,873 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 1177 transitions. [2019-08-05 10:08:12,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1177 transitions. [2019-08-05 10:08:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:12,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:12,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:12,875 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2019-08-05 10:08:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:12,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:12,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:13,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:13,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:13,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:13,031 INFO L87 Difference]: Start difference. First operand 483 states and 1177 transitions. Second operand 8 states. [2019-08-05 10:08:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:14,843 INFO L93 Difference]: Finished difference Result 1169 states and 2718 transitions. [2019-08-05 10:08:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:08:14,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:14,849 INFO L225 Difference]: With dead ends: 1169 [2019-08-05 10:08:14,849 INFO L226 Difference]: Without dead ends: 1169 [2019-08-05 10:08:14,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:08:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-08-05 10:08:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 697. [2019-08-05 10:08:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-08-05 10:08:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1710 transitions. [2019-08-05 10:08:14,861 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1710 transitions. Word has length 12 [2019-08-05 10:08:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:14,861 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1710 transitions. [2019-08-05 10:08:14,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1710 transitions. [2019-08-05 10:08:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:14,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:14,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:14,863 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2019-08-05 10:08:14,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:14,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:14,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:14,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:14,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:14,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:14,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:14,927 INFO L87 Difference]: Start difference. First operand 697 states and 1710 transitions. Second operand 8 states. [2019-08-05 10:08:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:16,605 INFO L93 Difference]: Finished difference Result 1231 states and 2836 transitions. [2019-08-05 10:08:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:08:16,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:16,612 INFO L225 Difference]: With dead ends: 1231 [2019-08-05 10:08:16,612 INFO L226 Difference]: Without dead ends: 1231 [2019-08-05 10:08:16,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-08-05 10:08:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 709. [2019-08-05 10:08:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-08-05 10:08:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1740 transitions. [2019-08-05 10:08:16,629 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1740 transitions. Word has length 12 [2019-08-05 10:08:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:16,629 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1740 transitions. [2019-08-05 10:08:16,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1740 transitions. [2019-08-05 10:08:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:16,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:16,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:16,631 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2019-08-05 10:08:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:16,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:16,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:16,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:16,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:16,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:16,859 INFO L87 Difference]: Start difference. First operand 709 states and 1740 transitions. Second operand 8 states. [2019-08-05 10:08:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:19,061 INFO L93 Difference]: Finished difference Result 1376 states and 3224 transitions. [2019-08-05 10:08:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:08:19,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:19,068 INFO L225 Difference]: With dead ends: 1376 [2019-08-05 10:08:19,069 INFO L226 Difference]: Without dead ends: 1376 [2019-08-05 10:08:19,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:08:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-08-05 10:08:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 756. [2019-08-05 10:08:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-08-05 10:08:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1867 transitions. [2019-08-05 10:08:19,084 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1867 transitions. Word has length 12 [2019-08-05 10:08:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:19,084 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 1867 transitions. [2019-08-05 10:08:19,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1867 transitions. [2019-08-05 10:08:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:19,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:19,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:19,086 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2019-08-05 10:08:19,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:19,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:19,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:19,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:19,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:19,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:19,164 INFO L87 Difference]: Start difference. First operand 756 states and 1867 transitions. Second operand 8 states. [2019-08-05 10:08:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:20,766 INFO L93 Difference]: Finished difference Result 1294 states and 2987 transitions. [2019-08-05 10:08:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:08:20,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:20,772 INFO L225 Difference]: With dead ends: 1294 [2019-08-05 10:08:20,772 INFO L226 Difference]: Without dead ends: 1294 [2019-08-05 10:08:20,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:08:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-08-05 10:08:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 799. [2019-08-05 10:08:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-08-05 10:08:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1966 transitions. [2019-08-05 10:08:20,789 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1966 transitions. Word has length 12 [2019-08-05 10:08:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:20,790 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1966 transitions. [2019-08-05 10:08:20,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1966 transitions. [2019-08-05 10:08:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:20,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:20,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:20,792 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2019-08-05 10:08:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:20,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:20,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:20,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:20,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:20,886 INFO L87 Difference]: Start difference. First operand 799 states and 1966 transitions. Second operand 8 states. [2019-08-05 10:08:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:23,101 INFO L93 Difference]: Finished difference Result 1532 states and 3571 transitions. [2019-08-05 10:08:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:08:23,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:23,111 INFO L225 Difference]: With dead ends: 1532 [2019-08-05 10:08:23,111 INFO L226 Difference]: Without dead ends: 1532 [2019-08-05 10:08:23,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:08:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-08-05 10:08:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 762. [2019-08-05 10:08:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-08-05 10:08:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1879 transitions. [2019-08-05 10:08:23,128 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1879 transitions. Word has length 12 [2019-08-05 10:08:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:23,129 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1879 transitions. [2019-08-05 10:08:23,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1879 transitions. [2019-08-05 10:08:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:23,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:23,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:23,130 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2019-08-05 10:08:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:23,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:23,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:23,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:23,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:23,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:23,216 INFO L87 Difference]: Start difference. First operand 762 states and 1879 transitions. Second operand 8 states. [2019-08-05 10:08:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:25,785 INFO L93 Difference]: Finished difference Result 1485 states and 3491 transitions. [2019-08-05 10:08:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:08:25,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:25,793 INFO L225 Difference]: With dead ends: 1485 [2019-08-05 10:08:25,793 INFO L226 Difference]: Without dead ends: 1485 [2019-08-05 10:08:25,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:08:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-08-05 10:08:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 780. [2019-08-05 10:08:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-08-05 10:08:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1919 transitions. [2019-08-05 10:08:25,809 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1919 transitions. Word has length 12 [2019-08-05 10:08:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:25,809 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1919 transitions. [2019-08-05 10:08:25,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1919 transitions. [2019-08-05 10:08:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:25,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:25,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:25,811 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:25,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:25,811 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2019-08-05 10:08:25,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:25,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:25,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:25,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:25,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:25,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:25,894 INFO L87 Difference]: Start difference. First operand 780 states and 1919 transitions. Second operand 8 states. [2019-08-05 10:08:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:27,158 INFO L93 Difference]: Finished difference Result 1058 states and 2483 transitions. [2019-08-05 10:08:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:08:27,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:27,165 INFO L225 Difference]: With dead ends: 1058 [2019-08-05 10:08:27,166 INFO L226 Difference]: Without dead ends: 1058 [2019-08-05 10:08:27,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:08:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-08-05 10:08:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 783. [2019-08-05 10:08:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-05 10:08:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1927 transitions. [2019-08-05 10:08:27,182 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1927 transitions. Word has length 12 [2019-08-05 10:08:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:27,182 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1927 transitions. [2019-08-05 10:08:27,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1927 transitions. [2019-08-05 10:08:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:27,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:27,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:27,184 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2019-08-05 10:08:27,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:27,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:27,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:27,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:27,270 INFO L87 Difference]: Start difference. First operand 783 states and 1927 transitions. Second operand 8 states. [2019-08-05 10:08:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:29,285 INFO L93 Difference]: Finished difference Result 1295 states and 3071 transitions. [2019-08-05 10:08:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:08:29,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:29,291 INFO L225 Difference]: With dead ends: 1295 [2019-08-05 10:08:29,291 INFO L226 Difference]: Without dead ends: 1295 [2019-08-05 10:08:29,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:08:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-08-05 10:08:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 746. [2019-08-05 10:08:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-08-05 10:08:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1840 transitions. [2019-08-05 10:08:29,306 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1840 transitions. Word has length 12 [2019-08-05 10:08:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:29,307 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1840 transitions. [2019-08-05 10:08:29,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1840 transitions. [2019-08-05 10:08:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:29,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:29,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:29,308 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2019-08-05 10:08:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:29,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:29,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:29,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:29,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:29,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:29,388 INFO L87 Difference]: Start difference. First operand 746 states and 1840 transitions. Second operand 8 states. [2019-08-05 10:08:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:31,519 INFO L93 Difference]: Finished difference Result 1428 states and 3394 transitions. [2019-08-05 10:08:31,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:08:31,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:31,523 INFO L225 Difference]: With dead ends: 1428 [2019-08-05 10:08:31,524 INFO L226 Difference]: Without dead ends: 1428 [2019-08-05 10:08:31,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:08:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-08-05 10:08:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 740. [2019-08-05 10:08:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-08-05 10:08:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1828 transitions. [2019-08-05 10:08:31,536 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1828 transitions. Word has length 12 [2019-08-05 10:08:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:31,536 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1828 transitions. [2019-08-05 10:08:31,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1828 transitions. [2019-08-05 10:08:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:08:31,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:31,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:31,538 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2019-08-05 10:08:31,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:31,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:31,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:31,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:31,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:31,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:31,614 INFO L87 Difference]: Start difference. First operand 740 states and 1828 transitions. Second operand 8 states. [2019-08-05 10:08:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:33,216 INFO L93 Difference]: Finished difference Result 1450 states and 3475 transitions. [2019-08-05 10:08:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:08:33,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:08:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:33,220 INFO L225 Difference]: With dead ends: 1450 [2019-08-05 10:08:33,220 INFO L226 Difference]: Without dead ends: 1450 [2019-08-05 10:08:33,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:08:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-08-05 10:08:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2019-08-05 10:08:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-08-05 10:08:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1959 transitions. [2019-08-05 10:08:33,235 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1959 transitions. Word has length 12 [2019-08-05 10:08:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:33,236 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1959 transitions. [2019-08-05 10:08:33,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1959 transitions. [2019-08-05 10:08:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:33,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:33,237 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:33,238 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash -987625651, now seen corresponding path program 1 times [2019-08-05 10:08:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:33,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:33,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:33,340 INFO L87 Difference]: Start difference. First operand 795 states and 1959 transitions. Second operand 10 states. [2019-08-05 10:08:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:34,531 INFO L93 Difference]: Finished difference Result 1372 states and 3343 transitions. [2019-08-05 10:08:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:34,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:34,535 INFO L225 Difference]: With dead ends: 1372 [2019-08-05 10:08:34,535 INFO L226 Difference]: Without dead ends: 1372 [2019-08-05 10:08:34,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-08-05 10:08:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 512. [2019-08-05 10:08:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:08:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1246 transitions. [2019-08-05 10:08:34,544 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1246 transitions. Word has length 16 [2019-08-05 10:08:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:34,544 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 1246 transitions. [2019-08-05 10:08:34,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1246 transitions. [2019-08-05 10:08:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:34,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:34,545 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:34,545 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1922316245, now seen corresponding path program 1 times [2019-08-05 10:08:34,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:34,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:34,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:34,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:34,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:34,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:34,622 INFO L87 Difference]: Start difference. First operand 512 states and 1246 transitions. Second operand 10 states. [2019-08-05 10:08:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:36,313 INFO L93 Difference]: Finished difference Result 1513 states and 3652 transitions. [2019-08-05 10:08:36,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:08:36,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:36,317 INFO L225 Difference]: With dead ends: 1513 [2019-08-05 10:08:36,317 INFO L226 Difference]: Without dead ends: 1513 [2019-08-05 10:08:36,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:08:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-08-05 10:08:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 515. [2019-08-05 10:08:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-08-05 10:08:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1252 transitions. [2019-08-05 10:08:36,330 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1252 transitions. Word has length 16 [2019-08-05 10:08:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:36,331 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 1252 transitions. [2019-08-05 10:08:36,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1252 transitions. [2019-08-05 10:08:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:36,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:36,332 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:36,332 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:36,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1925116599, now seen corresponding path program 1 times [2019-08-05 10:08:36,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:36,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:36,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:36,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:36,803 INFO L87 Difference]: Start difference. First operand 515 states and 1252 transitions. Second operand 10 states. [2019-08-05 10:08:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:38,347 INFO L93 Difference]: Finished difference Result 1288 states and 3088 transitions. [2019-08-05 10:08:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:08:38,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:38,351 INFO L225 Difference]: With dead ends: 1288 [2019-08-05 10:08:38,351 INFO L226 Difference]: Without dead ends: 1288 [2019-08-05 10:08:38,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:08:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-08-05 10:08:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 542. [2019-08-05 10:08:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-08-05 10:08:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1332 transitions. [2019-08-05 10:08:38,363 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1332 transitions. Word has length 16 [2019-08-05 10:08:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:38,364 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 1332 transitions. [2019-08-05 10:08:38,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1332 transitions. [2019-08-05 10:08:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:38,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:38,365 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:38,366 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2019-08-05 10:08:38,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:38,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:38,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:38,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:38,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:38,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:38,592 INFO L87 Difference]: Start difference. First operand 542 states and 1332 transitions. Second operand 10 states. [2019-08-05 10:08:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:39,821 INFO L93 Difference]: Finished difference Result 888 states and 2108 transitions. [2019-08-05 10:08:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:39,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:39,825 INFO L225 Difference]: With dead ends: 888 [2019-08-05 10:08:39,825 INFO L226 Difference]: Without dead ends: 888 [2019-08-05 10:08:39,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:08:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-08-05 10:08:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 532. [2019-08-05 10:08:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-08-05 10:08:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1291 transitions. [2019-08-05 10:08:39,836 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1291 transitions. Word has length 16 [2019-08-05 10:08:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:39,836 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 1291 transitions. [2019-08-05 10:08:39,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1291 transitions. [2019-08-05 10:08:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:39,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:39,837 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:39,838 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 91368871, now seen corresponding path program 1 times [2019-08-05 10:08:39,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:39,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:39,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:40,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:40,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:40,066 INFO L87 Difference]: Start difference. First operand 532 states and 1291 transitions. Second operand 10 states. [2019-08-05 10:08:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:42,459 INFO L93 Difference]: Finished difference Result 1180 states and 2742 transitions. [2019-08-05 10:08:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:08:42,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:42,464 INFO L225 Difference]: With dead ends: 1180 [2019-08-05 10:08:42,464 INFO L226 Difference]: Without dead ends: 1180 [2019-08-05 10:08:42,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:08:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-08-05 10:08:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 510. [2019-08-05 10:08:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-08-05 10:08:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1241 transitions. [2019-08-05 10:08:42,477 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1241 transitions. Word has length 16 [2019-08-05 10:08:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:42,477 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 1241 transitions. [2019-08-05 10:08:42,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1241 transitions. [2019-08-05 10:08:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:42,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:42,479 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:42,479 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 88568517, now seen corresponding path program 1 times [2019-08-05 10:08:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:42,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:42,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:42,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:42,625 INFO L87 Difference]: Start difference. First operand 510 states and 1241 transitions. Second operand 10 states. [2019-08-05 10:08:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:45,223 INFO L93 Difference]: Finished difference Result 1224 states and 2825 transitions. [2019-08-05 10:08:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:08:45,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:45,225 INFO L225 Difference]: With dead ends: 1224 [2019-08-05 10:08:45,226 INFO L226 Difference]: Without dead ends: 1224 [2019-08-05 10:08:45,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:08:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-08-05 10:08:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 537. [2019-08-05 10:08:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-08-05 10:08:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1321 transitions. [2019-08-05 10:08:45,236 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1321 transitions. Word has length 16 [2019-08-05 10:08:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:45,236 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 1321 transitions. [2019-08-05 10:08:45,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1321 transitions. [2019-08-05 10:08:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:45,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:45,237 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:45,237 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:45,238 INFO L82 PathProgramCache]: Analyzing trace with hash 88670662, now seen corresponding path program 1 times [2019-08-05 10:08:45,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:45,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:45,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:45,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:45,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:45,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:45,391 INFO L87 Difference]: Start difference. First operand 537 states and 1321 transitions. Second operand 10 states. [2019-08-05 10:08:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:47,417 INFO L93 Difference]: Finished difference Result 957 states and 2203 transitions. [2019-08-05 10:08:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:08:47,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:47,419 INFO L225 Difference]: With dead ends: 957 [2019-08-05 10:08:47,419 INFO L226 Difference]: Without dead ends: 957 [2019-08-05 10:08:47,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:08:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-08-05 10:08:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 507. [2019-08-05 10:08:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-05 10:08:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1235 transitions. [2019-08-05 10:08:47,428 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1235 transitions. Word has length 16 [2019-08-05 10:08:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:47,428 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 1235 transitions. [2019-08-05 10:08:47,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1235 transitions. [2019-08-05 10:08:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:47,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:47,429 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:47,430 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 385942279, now seen corresponding path program 1 times [2019-08-05 10:08:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:47,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:47,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:47,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:47,610 INFO L87 Difference]: Start difference. First operand 507 states and 1235 transitions. Second operand 10 states. [2019-08-05 10:08:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:49,925 INFO L93 Difference]: Finished difference Result 1054 states and 2437 transitions. [2019-08-05 10:08:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:08:49,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:49,928 INFO L225 Difference]: With dead ends: 1054 [2019-08-05 10:08:49,928 INFO L226 Difference]: Without dead ends: 1054 [2019-08-05 10:08:49,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:08:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-08-05 10:08:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 444. [2019-08-05 10:08:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-08-05 10:08:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1067 transitions. [2019-08-05 10:08:49,939 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1067 transitions. Word has length 16 [2019-08-05 10:08:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:49,939 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 1067 transitions. [2019-08-05 10:08:49,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1067 transitions. [2019-08-05 10:08:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:49,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:49,940 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:49,940 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash 386044424, now seen corresponding path program 1 times [2019-08-05 10:08:49,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:49,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:49,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:50,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:50,024 INFO L87 Difference]: Start difference. First operand 444 states and 1067 transitions. Second operand 10 states. [2019-08-05 10:08:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:51,989 INFO L93 Difference]: Finished difference Result 877 states and 2008 transitions. [2019-08-05 10:08:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:51,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:51,991 INFO L225 Difference]: With dead ends: 877 [2019-08-05 10:08:51,991 INFO L226 Difference]: Without dead ends: 877 [2019-08-05 10:08:51,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:08:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-08-05 10:08:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 438. [2019-08-05 10:08:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:08:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1052 transitions. [2019-08-05 10:08:52,001 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1052 transitions. Word has length 16 [2019-08-05 10:08:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:52,001 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 1052 transitions. [2019-08-05 10:08:52,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1052 transitions. [2019-08-05 10:08:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:52,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:52,004 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:52,004 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash 394958660, now seen corresponding path program 1 times [2019-08-05 10:08:52,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:52,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:52,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:52,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:52,140 INFO L87 Difference]: Start difference. First operand 438 states and 1052 transitions. Second operand 10 states. [2019-08-05 10:08:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:53,966 INFO L93 Difference]: Finished difference Result 797 states and 1847 transitions. [2019-08-05 10:08:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:53,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:53,968 INFO L225 Difference]: With dead ends: 797 [2019-08-05 10:08:53,968 INFO L226 Difference]: Without dead ends: 797 [2019-08-05 10:08:53,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-08-05 10:08:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 298. [2019-08-05 10:08:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-08-05 10:08:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 699 transitions. [2019-08-05 10:08:53,974 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 699 transitions. Word has length 16 [2019-08-05 10:08:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:53,974 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 699 transitions. [2019-08-05 10:08:53,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 699 transitions. [2019-08-05 10:08:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:53,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:53,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:53,975 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash -884179606, now seen corresponding path program 1 times [2019-08-05 10:08:53,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:53,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:53,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:54,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:54,095 INFO L87 Difference]: Start difference. First operand 298 states and 699 transitions. Second operand 10 states. [2019-08-05 10:08:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:56,108 INFO L93 Difference]: Finished difference Result 583 states and 1322 transitions. [2019-08-05 10:08:56,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:56,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:56,110 INFO L225 Difference]: With dead ends: 583 [2019-08-05 10:08:56,110 INFO L226 Difference]: Without dead ends: 583 [2019-08-05 10:08:56,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-08-05 10:08:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 287. [2019-08-05 10:08:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-05 10:08:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 665 transitions. [2019-08-05 10:08:56,115 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 665 transitions. Word has length 16 [2019-08-05 10:08:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:56,115 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 665 transitions. [2019-08-05 10:08:56,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 665 transitions. [2019-08-05 10:08:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:56,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:56,116 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:56,116 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash -886878094, now seen corresponding path program 1 times [2019-08-05 10:08:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:56,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:56,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:56,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:56,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:56,177 INFO L87 Difference]: Start difference. First operand 287 states and 665 transitions. Second operand 10 states. [2019-08-05 10:08:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:58,173 INFO L93 Difference]: Finished difference Result 619 states and 1366 transitions. [2019-08-05 10:08:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:58,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:08:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:58,174 INFO L225 Difference]: With dead ends: 619 [2019-08-05 10:08:58,174 INFO L226 Difference]: Without dead ends: 619 [2019-08-05 10:08:58,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:08:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-08-05 10:08:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 291. [2019-08-05 10:08:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 10:08:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 675 transitions. [2019-08-05 10:08:58,180 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 675 transitions. Word has length 16 [2019-08-05 10:08:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:58,181 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 675 transitions. [2019-08-05 10:08:58,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 675 transitions. [2019-08-05 10:08:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:08:58,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:58,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:58,182 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash -886877815, now seen corresponding path program 1 times [2019-08-05 10:08:58,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:58,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:58,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:58,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:58,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:58,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:58,251 INFO L87 Difference]: Start difference. First operand 291 states and 675 transitions. Second operand 10 states. [2019-08-05 10:09:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:00,809 INFO L93 Difference]: Finished difference Result 665 states and 1507 transitions. [2019-08-05 10:09:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:09:00,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:00,811 INFO L225 Difference]: With dead ends: 665 [2019-08-05 10:09:00,811 INFO L226 Difference]: Without dead ends: 665 [2019-08-05 10:09:00,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:09:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-08-05 10:09:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 257. [2019-08-05 10:09:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:09:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 588 transitions. [2019-08-05 10:09:00,817 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 588 transitions. Word has length 16 [2019-08-05 10:09:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:00,818 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 588 transitions. [2019-08-05 10:09:00,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 588 transitions. [2019-08-05 10:09:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:00,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:00,819 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:00,819 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 344711637, now seen corresponding path program 1 times [2019-08-05 10:09:00,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:00,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:00,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:00,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:00,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:00,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:00,891 INFO L87 Difference]: Start difference. First operand 257 states and 588 transitions. Second operand 10 states. [2019-08-05 10:09:02,420 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-08-05 10:09:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:03,180 INFO L93 Difference]: Finished difference Result 634 states and 1404 transitions. [2019-08-05 10:09:03,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:09:03,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:03,182 INFO L225 Difference]: With dead ends: 634 [2019-08-05 10:09:03,182 INFO L226 Difference]: Without dead ends: 634 [2019-08-05 10:09:03,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:09:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-05 10:09:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 277. [2019-08-05 10:09:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 10:09:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 633 transitions. [2019-08-05 10:09:03,188 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 633 transitions. Word has length 16 [2019-08-05 10:09:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:03,188 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 633 transitions. [2019-08-05 10:09:03,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 633 transitions. [2019-08-05 10:09:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:03,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:03,188 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:03,189 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash 344711916, now seen corresponding path program 1 times [2019-08-05 10:09:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:03,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:03,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:03,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:03,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:03,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:03,267 INFO L87 Difference]: Start difference. First operand 277 states and 633 transitions. Second operand 10 states. [2019-08-05 10:09:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:06,009 INFO L93 Difference]: Finished difference Result 728 states and 1636 transitions. [2019-08-05 10:09:06,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:09:06,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:06,011 INFO L225 Difference]: With dead ends: 728 [2019-08-05 10:09:06,011 INFO L226 Difference]: Without dead ends: 728 [2019-08-05 10:09:06,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:09:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-08-05 10:09:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 259. [2019-08-05 10:09:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:09:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 592 transitions. [2019-08-05 10:09:06,017 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 592 transitions. Word has length 16 [2019-08-05 10:09:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:06,017 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 592 transitions. [2019-08-05 10:09:06,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 592 transitions. [2019-08-05 10:09:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:06,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:06,018 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:06,018 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash 348591473, now seen corresponding path program 1 times [2019-08-05 10:09:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:06,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:06,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:06,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:06,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:06,132 INFO L87 Difference]: Start difference. First operand 259 states and 592 transitions. Second operand 10 states. [2019-08-05 10:09:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:08,676 INFO L93 Difference]: Finished difference Result 705 states and 1605 transitions. [2019-08-05 10:09:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:09:08,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:08,683 INFO L225 Difference]: With dead ends: 705 [2019-08-05 10:09:08,683 INFO L226 Difference]: Without dead ends: 705 [2019-08-05 10:09:08,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:09:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-08-05 10:09:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 253. [2019-08-05 10:09:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:09:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-05 10:09:08,688 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-05 10:09:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:08,688 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-05 10:09:08,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-05 10:09:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:08,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:08,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:08,689 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -353600118, now seen corresponding path program 1 times [2019-08-05 10:09:08,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:08,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:08,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:08,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:08,847 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-05 10:09:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:10,560 INFO L93 Difference]: Finished difference Result 518 states and 1169 transitions. [2019-08-05 10:09:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:10,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:10,561 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:09:10,561 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:09:10,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:09:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:09:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 253. [2019-08-05 10:09:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:09:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-05 10:09:10,566 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-05 10:09:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:10,566 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-05 10:09:10,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-05 10:09:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:10,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:10,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:10,567 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash -353599839, now seen corresponding path program 1 times [2019-08-05 10:09:10,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:10,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:10,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:10,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:10,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:10,678 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-05 10:09:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:12,993 INFO L93 Difference]: Finished difference Result 663 states and 1513 transitions. [2019-08-05 10:09:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:09:12,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:12,994 INFO L225 Difference]: With dead ends: 663 [2019-08-05 10:09:12,995 INFO L226 Difference]: Without dead ends: 663 [2019-08-05 10:09:12,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:09:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-08-05 10:09:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 235. [2019-08-05 10:09:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 10:09:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 537 transitions. [2019-08-05 10:09:13,000 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 537 transitions. Word has length 16 [2019-08-05 10:09:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:13,000 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 537 transitions. [2019-08-05 10:09:13,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 537 transitions. [2019-08-05 10:09:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:13,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:13,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:13,001 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -349720282, now seen corresponding path program 1 times [2019-08-05 10:09:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:13,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:13,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:13,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:13,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:13,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:13,147 INFO L87 Difference]: Start difference. First operand 235 states and 537 transitions. Second operand 10 states. [2019-08-05 10:09:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:15,880 INFO L93 Difference]: Finished difference Result 692 states and 1586 transitions. [2019-08-05 10:09:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:09:15,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:15,882 INFO L225 Difference]: With dead ends: 692 [2019-08-05 10:09:15,883 INFO L226 Difference]: Without dead ends: 692 [2019-08-05 10:09:15,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:09:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-08-05 10:09:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 233. [2019-08-05 10:09:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:09:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 533 transitions. [2019-08-05 10:09:15,889 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 533 transitions. Word has length 16 [2019-08-05 10:09:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:15,889 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 533 transitions. [2019-08-05 10:09:15,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 533 transitions. [2019-08-05 10:09:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:09:15,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:15,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:15,890 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -260138745, now seen corresponding path program 1 times [2019-08-05 10:09:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:15,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:15,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:15,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:15,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:15,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:15,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:15,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:15,951 INFO L87 Difference]: Start difference. First operand 233 states and 533 transitions. Second operand 10 states. [2019-08-05 10:09:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:17,755 INFO L93 Difference]: Finished difference Result 528 states and 1232 transitions. [2019-08-05 10:09:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:09:17,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:09:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:17,756 INFO L225 Difference]: With dead ends: 528 [2019-08-05 10:09:17,756 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:09:17,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:09:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:09:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:09:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:09:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:09:17,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-08-05 10:09:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:17,758 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:09:17,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:09:17,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:09:17,764 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:09:17 BoogieIcfgContainer [2019-08-05 10:09:17,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:09:17,766 INFO L168 Benchmark]: Toolchain (without parser) took 96123.90 ms. Allocated memory was 135.8 MB in the beginning and 275.8 MB in the end (delta: 140.0 MB). Free memory was 112.4 MB in the beginning and 243.7 MB in the end (delta: -131.2 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:17,766 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:09:17,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.88 ms. Allocated memory is still 135.8 MB. Free memory was 112.4 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:17,768 INFO L168 Benchmark]: Boogie Preprocessor took 47.46 ms. Allocated memory is still 135.8 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:17,769 INFO L168 Benchmark]: RCFGBuilder took 897.09 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 84.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:17,769 INFO L168 Benchmark]: TraceAbstraction took 95121.29 ms. Allocated memory was 135.8 MB in the beginning and 275.8 MB in the end (delta: 140.0 MB). Free memory was 84.0 MB in the beginning and 243.7 MB in the end (delta: -159.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:09:17,772 INFO L335 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.26 ms. Allocated memory is still 135.8 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.88 ms. Allocated memory is still 135.8 MB. Free memory was 112.4 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.46 ms. Allocated memory is still 135.8 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.09 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 84.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95121.29 ms. Allocated memory was 135.8 MB in the beginning and 275.8 MB in the end (delta: 140.0 MB). Free memory was 84.0 MB in the beginning and 243.7 MB in the end (delta: -159.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 264]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 240]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 222]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 205]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 284]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 247]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 250]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 332]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 294]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 364]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 154]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 229]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 277]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 14 error locations. SAFE Result, 95.0s OverallTime, 44 OverallIterations, 2 TraceHistogramMax, 88.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12092 SDtfs, 30993 SDslu, 40849 SDs, 0 SdLazy, 74112 SolverSat, 6748 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1355 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 1007 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5273 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=18, 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: 0.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 20654 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 24280 SizeOfPredicates, 190 NumberOfNonLiveVariables, 1662 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 44 InterpolantComputations, 24 PerfectInterpolantSequences, 0/51 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...