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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:27,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:27,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:27,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:27,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:27,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:27,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:27,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:27,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:27,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:27,328 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:27,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:27,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:27,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:27,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:27,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:27,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:27,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:27,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:27,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:27,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:27,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:27,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:27,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:27,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:27,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:27,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:27,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:27,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:27,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:27,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:27,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:27,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:27,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:27,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:27,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:27,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:27,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:27,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:27,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:27,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:27,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:27,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:27,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:27,412 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:27,413 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:27,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2019-08-04 21:21:27,414 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2019-08-04 21:21:27,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:27,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:27,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:27,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:27,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:27,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,512 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:27,513 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:27,513 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:27,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:27,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:27,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:27,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:27,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/1) ... [2019-08-04 21:21:27,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:27,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:27,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:27,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:27,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (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-04 21:21:27,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-04 21:21:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-04 21:21:27,627 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-04 21:21:28,386 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-04 21:21:28,389 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:28,389 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:28,390 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:28 BoogieIcfgContainer [2019-08-04 21:21:28,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:28,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:28,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:28,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:28,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:27" (1/2) ... [2019-08-04 21:21:28,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa5af05 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:28, skipping insertion in model container [2019-08-04 21:21:28,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:28" (2/2) ... [2019-08-04 21:21:28,399 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2019-08-04 21:21:28,408 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:28,416 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-08-04 21:21:28,430 INFO L252 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-08-04 21:21:28,454 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:28,455 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:28,456 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:28,456 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:28,456 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:28,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:28,456 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:28,457 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:28,457 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-08-04 21:21:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:28,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:28,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:28,486 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2019-08-04 21:21:28,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:28,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:28,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:28,841 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-04 21:21:28,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:28,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:28,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:28,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:28,862 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2019-08-04 21:21:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:30,753 INFO L93 Difference]: Finished difference Result 158 states and 348 transitions. [2019-08-04 21:21:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:30,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:30,771 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:21:30,771 INFO L226 Difference]: Without dead ends: 158 [2019-08-04 21:21:30,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-04 21:21:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2019-08-04 21:21:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:21:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2019-08-04 21:21:30,820 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2019-08-04 21:21:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:30,820 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2019-08-04 21:21:30,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2019-08-04 21:21:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:30,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:30,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:30,823 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2019-08-04 21:21:30,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:30,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:30,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:30,954 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-04 21:21:30,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:30,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:30,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:30,958 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2019-08-04 21:21:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:31,719 INFO L93 Difference]: Finished difference Result 183 states and 408 transitions. [2019-08-04 21:21:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:31,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:31,724 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:21:31,725 INFO L226 Difference]: Without dead ends: 183 [2019-08-04 21:21:31,726 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-04 21:21:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-04 21:21:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2019-08-04 21:21:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-04 21:21:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2019-08-04 21:21:31,742 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2019-08-04 21:21:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:31,742 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2019-08-04 21:21:31,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2019-08-04 21:21:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:31,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:31,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:31,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2019-08-04 21:21:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:31,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:31,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:31,890 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-04 21:21:31,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:31,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:31,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:31,893 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2019-08-04 21:21:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:33,288 INFO L93 Difference]: Finished difference Result 212 states and 478 transitions. [2019-08-04 21:21:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:21:33,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-04 21:21:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:33,293 INFO L225 Difference]: With dead ends: 212 [2019-08-04 21:21:33,293 INFO L226 Difference]: Without dead ends: 212 [2019-08-04 21:21:33,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-04 21:21:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2019-08-04 21:21:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-04 21:21:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 304 transitions. [2019-08-04 21:21:33,305 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 304 transitions. Word has length 9 [2019-08-04 21:21:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:33,305 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 304 transitions. [2019-08-04 21:21:33,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 304 transitions. [2019-08-04 21:21:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:33,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:33,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:33,307 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2019-08-04 21:21:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:33,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:33,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:33,447 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-04 21:21:33,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:33,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:33,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:33,450 INFO L87 Difference]: Start difference. First operand 138 states and 304 transitions. Second operand 7 states. [2019-08-04 21:21:33,633 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-08-04 21:21:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:34,366 INFO L93 Difference]: Finished difference Result 253 states and 572 transitions. [2019-08-04 21:21:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:21:34,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-04 21:21:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:34,370 INFO L225 Difference]: With dead ends: 253 [2019-08-04 21:21:34,370 INFO L226 Difference]: Without dead ends: 253 [2019-08-04 21:21:34,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-04 21:21:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 159. [2019-08-04 21:21:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:21:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2019-08-04 21:21:34,400 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 9 [2019-08-04 21:21:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:34,401 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2019-08-04 21:21:34,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2019-08-04 21:21:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:34,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:34,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:34,406 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2019-08-04 21:21:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:34,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:34,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:34,548 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-04 21:21:34,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:34,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:34,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:34,550 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand 8 states. [2019-08-04 21:21:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:36,822 INFO L93 Difference]: Finished difference Result 798 states and 1815 transitions. [2019-08-04 21:21:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:36,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:36,830 INFO L225 Difference]: With dead ends: 798 [2019-08-04 21:21:36,830 INFO L226 Difference]: Without dead ends: 798 [2019-08-04 21:21:36,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-08-04 21:21:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 382. [2019-08-04 21:21:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-04 21:21:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 912 transitions. [2019-08-04 21:21:36,851 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 912 transitions. Word has length 12 [2019-08-04 21:21:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:36,852 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 912 transitions. [2019-08-04 21:21:36,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 912 transitions. [2019-08-04 21:21:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:36,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:36,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:36,855 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2019-08-04 21:21:36,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:36,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:36,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,951 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-04 21:21:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:36,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:36,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:36,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:36,952 INFO L87 Difference]: Start difference. First operand 382 states and 912 transitions. Second operand 8 states. [2019-08-04 21:21:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:41,661 INFO L93 Difference]: Finished difference Result 921 states and 2086 transitions. [2019-08-04 21:21:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:21:41,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:41,668 INFO L225 Difference]: With dead ends: 921 [2019-08-04 21:21:41,669 INFO L226 Difference]: Without dead ends: 921 [2019-08-04 21:21:41,670 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-04 21:21:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-08-04 21:21:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 388. [2019-08-04 21:21:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-04 21:21:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 924 transitions. [2019-08-04 21:21:41,688 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 924 transitions. Word has length 12 [2019-08-04 21:21:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:41,688 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 924 transitions. [2019-08-04 21:21:41,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 924 transitions. [2019-08-04 21:21:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:41,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:41,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:41,691 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2019-08-04 21:21:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:41,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:41,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:41,772 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-04 21:21:41,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:41,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:41,774 INFO L87 Difference]: Start difference. First operand 388 states and 924 transitions. Second operand 8 states. [2019-08-04 21:21:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,772 INFO L93 Difference]: Finished difference Result 817 states and 1840 transitions. [2019-08-04 21:21:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:44,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,780 INFO L225 Difference]: With dead ends: 817 [2019-08-04 21:21:44,780 INFO L226 Difference]: Without dead ends: 817 [2019-08-04 21:21:44,792 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-04 21:21:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-08-04 21:21:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 416. [2019-08-04 21:21:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-04 21:21:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1000 transitions. [2019-08-04 21:21:44,809 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1000 transitions. Word has length 12 [2019-08-04 21:21:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,810 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 1000 transitions. [2019-08-04 21:21:44,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1000 transitions. [2019-08-04 21:21:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:44,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:44,812 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2019-08-04 21:21:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,911 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-04 21:21:44,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:44,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:44,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:44,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:44,913 INFO L87 Difference]: Start difference. First operand 416 states and 1000 transitions. Second operand 8 states. [2019-08-04 21:21:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:46,385 INFO L93 Difference]: Finished difference Result 666 states and 1511 transitions. [2019-08-04 21:21:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:21:46,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:46,396 INFO L225 Difference]: With dead ends: 666 [2019-08-04 21:21:46,397 INFO L226 Difference]: Without dead ends: 666 [2019-08-04 21:21:46,397 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-04 21:21:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-08-04 21:21:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 422. [2019-08-04 21:21:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-04 21:21:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1004 transitions. [2019-08-04 21:21:46,410 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1004 transitions. Word has length 12 [2019-08-04 21:21:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:46,410 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 1004 transitions. [2019-08-04 21:21:46,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1004 transitions. [2019-08-04 21:21:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:46,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:46,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:46,412 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2019-08-04 21:21:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:46,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:46,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:46,513 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-04 21:21:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:46,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:46,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:46,516 INFO L87 Difference]: Start difference. First operand 422 states and 1004 transitions. Second operand 8 states. [2019-08-04 21:21:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,912 INFO L93 Difference]: Finished difference Result 1103 states and 2507 transitions. [2019-08-04 21:21:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:21:48,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,920 INFO L225 Difference]: With dead ends: 1103 [2019-08-04 21:21:48,920 INFO L226 Difference]: Without dead ends: 1103 [2019-08-04 21:21:48,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:21:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-08-04 21:21:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 434. [2019-08-04 21:21:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-04 21:21:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1032 transitions. [2019-08-04 21:21:48,936 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1032 transitions. Word has length 12 [2019-08-04 21:21:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,936 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 1032 transitions. [2019-08-04 21:21:48,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1032 transitions. [2019-08-04 21:21:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:48,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:48,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2019-08-04 21:21:48,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:49,045 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-04 21:21:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:49,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:49,047 INFO L87 Difference]: Start difference. First operand 434 states and 1032 transitions. Second operand 8 states. [2019-08-04 21:21:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:51,291 INFO L93 Difference]: Finished difference Result 1091 states and 2447 transitions. [2019-08-04 21:21:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:51,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:51,298 INFO L225 Difference]: With dead ends: 1091 [2019-08-04 21:21:51,299 INFO L226 Difference]: Without dead ends: 1091 [2019-08-04 21:21:51,299 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-04 21:21:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-08-04 21:21:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 462. [2019-08-04 21:21:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-04 21:21:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1108 transitions. [2019-08-04 21:21:51,316 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1108 transitions. Word has length 12 [2019-08-04 21:21:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:51,317 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1108 transitions. [2019-08-04 21:21:51,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1108 transitions. [2019-08-04 21:21:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:51,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:51,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:51,318 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:51,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2019-08-04 21:21:51,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:51,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:51,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:51,877 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-04 21:21:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:51,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:51,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:51,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:51,878 INFO L87 Difference]: Start difference. First operand 462 states and 1108 transitions. Second operand 8 states. [2019-08-04 21:21:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:53,714 INFO L93 Difference]: Finished difference Result 933 states and 2102 transitions. [2019-08-04 21:21:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:21:53,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:53,725 INFO L225 Difference]: With dead ends: 933 [2019-08-04 21:21:53,725 INFO L226 Difference]: Without dead ends: 933 [2019-08-04 21:21:53,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-08-04 21:21:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 428. [2019-08-04 21:21:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-04 21:21:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1020 transitions. [2019-08-04 21:21:53,739 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1020 transitions. Word has length 12 [2019-08-04 21:21:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:53,739 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 1020 transitions. [2019-08-04 21:21:53,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1020 transitions. [2019-08-04 21:21:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:53,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:53,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:53,741 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2019-08-04 21:21:53,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:53,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:53,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:53,908 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-04 21:21:53,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:53,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:53,910 INFO L87 Difference]: Start difference. First operand 428 states and 1020 transitions. Second operand 8 states. [2019-08-04 21:21:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,063 INFO L93 Difference]: Finished difference Result 1016 states and 2300 transitions. [2019-08-04 21:21:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:21:56,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,070 INFO L225 Difference]: With dead ends: 1016 [2019-08-04 21:21:56,070 INFO L226 Difference]: Without dead ends: 1016 [2019-08-04 21:21:56,071 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-04 21:21:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-04 21:21:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 474. [2019-08-04 21:21:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-04 21:21:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1152 transitions. [2019-08-04 21:21:56,083 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1152 transitions. Word has length 12 [2019-08-04 21:21:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,085 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 1152 transitions. [2019-08-04 21:21:56,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1152 transitions. [2019-08-04 21:21:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:56,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:56,086 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2019-08-04 21:21:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:56,196 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-04 21:21:56,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:56,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:56,197 INFO L87 Difference]: Start difference. First operand 474 states and 1152 transitions. Second operand 8 states. [2019-08-04 21:21:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:57,998 INFO L93 Difference]: Finished difference Result 919 states and 2083 transitions. [2019-08-04 21:21:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:21:57,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:58,003 INFO L225 Difference]: With dead ends: 919 [2019-08-04 21:21:58,003 INFO L226 Difference]: Without dead ends: 919 [2019-08-04 21:21:58,004 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-04 21:21:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-08-04 21:21:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 462. [2019-08-04 21:21:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-04 21:21:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1122 transitions. [2019-08-04 21:21:58,017 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1122 transitions. Word has length 12 [2019-08-04 21:21:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:58,018 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1122 transitions. [2019-08-04 21:21:58,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1122 transitions. [2019-08-04 21:21:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:58,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:58,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:58,020 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2019-08-04 21:21:58,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:58,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:58,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:58,137 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-04 21:21:58,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:58,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:58,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:58,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:58,138 INFO L87 Difference]: Start difference. First operand 462 states and 1122 transitions. Second operand 8 states. [2019-08-04 21:21:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:59,949 INFO L93 Difference]: Finished difference Result 945 states and 2174 transitions. [2019-08-04 21:21:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:21:59,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:59,955 INFO L225 Difference]: With dead ends: 945 [2019-08-04 21:21:59,955 INFO L226 Difference]: Without dead ends: 945 [2019-08-04 21:21:59,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:21:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-08-04 21:21:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 483. [2019-08-04 21:21:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-08-04 21:21:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1177 transitions. [2019-08-04 21:21:59,967 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1177 transitions. Word has length 12 [2019-08-04 21:21:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:59,968 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 1177 transitions. [2019-08-04 21:21:59,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1177 transitions. [2019-08-04 21:21:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:59,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:59,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:59,969 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2019-08-04 21:21:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:59,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:59,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:00,248 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-04 21:22:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:00,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:00,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:00,249 INFO L87 Difference]: Start difference. First operand 483 states and 1177 transitions. Second operand 8 states. [2019-08-04 21:22:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:01,984 INFO L93 Difference]: Finished difference Result 1169 states and 2718 transitions. [2019-08-04 21:22:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:01,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:01,991 INFO L225 Difference]: With dead ends: 1169 [2019-08-04 21:22:01,991 INFO L226 Difference]: Without dead ends: 1169 [2019-08-04 21:22:01,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-08-04 21:22:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 697. [2019-08-04 21:22:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-08-04 21:22:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1710 transitions. [2019-08-04 21:22:02,005 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1710 transitions. Word has length 12 [2019-08-04 21:22:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:02,006 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1710 transitions. [2019-08-04 21:22:02,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1710 transitions. [2019-08-04 21:22:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:02,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:02,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:02,007 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2019-08-04 21:22:02,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:02,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:02,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:02,205 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-04 21:22:02,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:02,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:02,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:02,207 INFO L87 Difference]: Start difference. First operand 697 states and 1710 transitions. Second operand 8 states. [2019-08-04 21:22:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:03,943 INFO L93 Difference]: Finished difference Result 1231 states and 2836 transitions. [2019-08-04 21:22:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:03,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:03,950 INFO L225 Difference]: With dead ends: 1231 [2019-08-04 21:22:03,950 INFO L226 Difference]: Without dead ends: 1231 [2019-08-04 21:22:03,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-08-04 21:22:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 709. [2019-08-04 21:22:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-08-04 21:22:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1740 transitions. [2019-08-04 21:22:03,966 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1740 transitions. Word has length 12 [2019-08-04 21:22:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:03,967 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1740 transitions. [2019-08-04 21:22:03,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1740 transitions. [2019-08-04 21:22:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:03,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:03,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:03,968 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2019-08-04 21:22:03,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:03,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:04,040 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-04 21:22:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:04,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:04,042 INFO L87 Difference]: Start difference. First operand 709 states and 1740 transitions. Second operand 8 states. [2019-08-04 21:22:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:06,095 INFO L93 Difference]: Finished difference Result 1376 states and 3224 transitions. [2019-08-04 21:22:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:06,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:06,103 INFO L225 Difference]: With dead ends: 1376 [2019-08-04 21:22:06,103 INFO L226 Difference]: Without dead ends: 1376 [2019-08-04 21:22:06,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-08-04 21:22:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 756. [2019-08-04 21:22:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-08-04 21:22:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1867 transitions. [2019-08-04 21:22:06,119 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1867 transitions. Word has length 12 [2019-08-04 21:22:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:06,119 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 1867 transitions. [2019-08-04 21:22:06,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1867 transitions. [2019-08-04 21:22:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:06,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:06,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:06,121 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2019-08-04 21:22:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:06,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:06,209 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-04 21:22:06,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:06,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:06,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:06,210 INFO L87 Difference]: Start difference. First operand 756 states and 1867 transitions. Second operand 8 states. [2019-08-04 21:22:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:07,711 INFO L93 Difference]: Finished difference Result 1294 states and 2987 transitions. [2019-08-04 21:22:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:07,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:07,719 INFO L225 Difference]: With dead ends: 1294 [2019-08-04 21:22:07,719 INFO L226 Difference]: Without dead ends: 1294 [2019-08-04 21:22:07,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-08-04 21:22:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 799. [2019-08-04 21:22:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-08-04 21:22:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1966 transitions. [2019-08-04 21:22:07,737 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1966 transitions. Word has length 12 [2019-08-04 21:22:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:07,737 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1966 transitions. [2019-08-04 21:22:07,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1966 transitions. [2019-08-04 21:22:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:07,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:07,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:07,739 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2019-08-04 21:22:07,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:07,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:07,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:07,826 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-04 21:22:07,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:07,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:07,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:07,828 INFO L87 Difference]: Start difference. First operand 799 states and 1966 transitions. Second operand 8 states. [2019-08-04 21:22:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:10,120 INFO L93 Difference]: Finished difference Result 1532 states and 3571 transitions. [2019-08-04 21:22:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:10,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:10,130 INFO L225 Difference]: With dead ends: 1532 [2019-08-04 21:22:10,130 INFO L226 Difference]: Without dead ends: 1532 [2019-08-04 21:22:10,131 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-04 21:22:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-08-04 21:22:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 762. [2019-08-04 21:22:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-08-04 21:22:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1879 transitions. [2019-08-04 21:22:10,149 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1879 transitions. Word has length 12 [2019-08-04 21:22:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:10,149 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1879 transitions. [2019-08-04 21:22:10,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1879 transitions. [2019-08-04 21:22:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:10,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:10,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:10,151 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2019-08-04 21:22:10,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:10,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:10,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:10,234 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-04 21:22:10,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:10,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:10,236 INFO L87 Difference]: Start difference. First operand 762 states and 1879 transitions. Second operand 8 states. [2019-08-04 21:22:10,713 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:22:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,673 INFO L93 Difference]: Finished difference Result 1485 states and 3491 transitions. [2019-08-04 21:22:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:22:12,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,682 INFO L225 Difference]: With dead ends: 1485 [2019-08-04 21:22:12,682 INFO L226 Difference]: Without dead ends: 1485 [2019-08-04 21:22:12,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-08-04 21:22:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 780. [2019-08-04 21:22:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-08-04 21:22:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1919 transitions. [2019-08-04 21:22:12,701 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1919 transitions. Word has length 12 [2019-08-04 21:22:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,701 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1919 transitions. [2019-08-04 21:22:12,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1919 transitions. [2019-08-04 21:22:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:12,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:12,703 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2019-08-04 21:22:12,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,785 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-04 21:22:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:12,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:12,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:12,787 INFO L87 Difference]: Start difference. First operand 780 states and 1919 transitions. Second operand 8 states. [2019-08-04 21:22:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,213 INFO L93 Difference]: Finished difference Result 1058 states and 2483 transitions. [2019-08-04 21:22:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:14,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,219 INFO L225 Difference]: With dead ends: 1058 [2019-08-04 21:22:14,219 INFO L226 Difference]: Without dead ends: 1058 [2019-08-04 21:22:14,220 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-04 21:22:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-08-04 21:22:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 783. [2019-08-04 21:22:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-04 21:22:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1927 transitions. [2019-08-04 21:22:14,234 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1927 transitions. Word has length 12 [2019-08-04 21:22:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,234 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1927 transitions. [2019-08-04 21:22:14,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1927 transitions. [2019-08-04 21:22:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:14,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:14,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:14,235 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2019-08-04 21:22:14,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:14,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:14,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:14,304 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-04 21:22:14,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:14,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:14,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:14,306 INFO L87 Difference]: Start difference. First operand 783 states and 1927 transitions. Second operand 8 states. [2019-08-04 21:22:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:16,146 INFO L93 Difference]: Finished difference Result 1295 states and 3071 transitions. [2019-08-04 21:22:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:16,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:16,153 INFO L225 Difference]: With dead ends: 1295 [2019-08-04 21:22:16,153 INFO L226 Difference]: Without dead ends: 1295 [2019-08-04 21:22:16,154 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-04 21:22:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-08-04 21:22:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 746. [2019-08-04 21:22:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-08-04 21:22:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1840 transitions. [2019-08-04 21:22:16,166 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1840 transitions. Word has length 12 [2019-08-04 21:22:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:16,166 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1840 transitions. [2019-08-04 21:22:16,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1840 transitions. [2019-08-04 21:22:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:16,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:16,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:16,167 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2019-08-04 21:22:16,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:16,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:16,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:16,267 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-04 21:22:16,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:16,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:16,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:16,268 INFO L87 Difference]: Start difference. First operand 746 states and 1840 transitions. Second operand 8 states. [2019-08-04 21:22:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:18,420 INFO L93 Difference]: Finished difference Result 1428 states and 3394 transitions. [2019-08-04 21:22:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:22:18,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:18,425 INFO L225 Difference]: With dead ends: 1428 [2019-08-04 21:22:18,425 INFO L226 Difference]: Without dead ends: 1428 [2019-08-04 21:22:18,426 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-04 21:22:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-08-04 21:22:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 740. [2019-08-04 21:22:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-08-04 21:22:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1828 transitions. [2019-08-04 21:22:18,441 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1828 transitions. Word has length 12 [2019-08-04 21:22:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:18,441 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1828 transitions. [2019-08-04 21:22:18,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1828 transitions. [2019-08-04 21:22:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:18,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:18,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:18,443 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:18,444 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2019-08-04 21:22:18,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:18,546 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-04 21:22:18,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:18,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:18,548 INFO L87 Difference]: Start difference. First operand 740 states and 1828 transitions. Second operand 8 states. [2019-08-04 21:22:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:20,264 INFO L93 Difference]: Finished difference Result 1450 states and 3475 transitions. [2019-08-04 21:22:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:20,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:20,269 INFO L225 Difference]: With dead ends: 1450 [2019-08-04 21:22:20,269 INFO L226 Difference]: Without dead ends: 1450 [2019-08-04 21:22:20,270 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-04 21:22:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-08-04 21:22:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2019-08-04 21:22:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-08-04 21:22:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1959 transitions. [2019-08-04 21:22:20,285 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1959 transitions. Word has length 12 [2019-08-04 21:22:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:20,285 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1959 transitions. [2019-08-04 21:22:20,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1959 transitions. [2019-08-04 21:22:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:20,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:20,287 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:20,287 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -987625651, now seen corresponding path program 1 times [2019-08-04 21:22:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:20,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:20,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:20,393 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-04 21:22:20,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:20,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:20,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:20,395 INFO L87 Difference]: Start difference. First operand 795 states and 1959 transitions. Second operand 10 states. [2019-08-04 21:22:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:21,891 INFO L93 Difference]: Finished difference Result 1415 states and 3419 transitions. [2019-08-04 21:22:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:21,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:21,895 INFO L225 Difference]: With dead ends: 1415 [2019-08-04 21:22:21,895 INFO L226 Difference]: Without dead ends: 1415 [2019-08-04 21:22:21,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-08-04 21:22:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 708. [2019-08-04 21:22:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-08-04 21:22:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1738 transitions. [2019-08-04 21:22:21,911 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1738 transitions. Word has length 16 [2019-08-04 21:22:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:21,912 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1738 transitions. [2019-08-04 21:22:21,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1738 transitions. [2019-08-04 21:22:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:21,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:21,913 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:21,914 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1303373677, now seen corresponding path program 1 times [2019-08-04 21:22:21,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:21,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:21,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:22,059 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-04 21:22:22,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:22,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:22,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:22,060 INFO L87 Difference]: Start difference. First operand 708 states and 1738 transitions. Second operand 10 states. [2019-08-04 21:22:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:24,499 INFO L93 Difference]: Finished difference Result 2271 states and 5507 transitions. [2019-08-04 21:22:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:24,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:24,505 INFO L225 Difference]: With dead ends: 2271 [2019-08-04 21:22:24,505 INFO L226 Difference]: Without dead ends: 2271 [2019-08-04 21:22:24,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-08-04 21:22:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 827. [2019-08-04 21:22:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-08-04 21:22:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2076 transitions. [2019-08-04 21:22:24,526 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2076 transitions. Word has length 16 [2019-08-04 21:22:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:24,526 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 2076 transitions. [2019-08-04 21:22:24,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2076 transitions. [2019-08-04 21:22:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:24,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:24,528 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:24,528 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1922316245, now seen corresponding path program 1 times [2019-08-04 21:22:24,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:24,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:24,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:24,705 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-04 21:22:24,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:24,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:24,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:24,707 INFO L87 Difference]: Start difference. First operand 827 states and 2076 transitions. Second operand 10 states. [2019-08-04 21:22:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:27,553 INFO L93 Difference]: Finished difference Result 1841 states and 4404 transitions. [2019-08-04 21:22:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:22:27,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:27,559 INFO L225 Difference]: With dead ends: 1841 [2019-08-04 21:22:27,559 INFO L226 Difference]: Without dead ends: 1841 [2019-08-04 21:22:27,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:22:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-08-04 21:22:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 833. [2019-08-04 21:22:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-08-04 21:22:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2091 transitions. [2019-08-04 21:22:27,577 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2091 transitions. Word has length 16 [2019-08-04 21:22:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:27,577 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 2091 transitions. [2019-08-04 21:22:27,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2091 transitions. [2019-08-04 21:22:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:27,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:27,579 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:27,579 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1925116599, now seen corresponding path program 1 times [2019-08-04 21:22:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:27,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:27,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:27,959 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-04 21:22:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:27,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:27,961 INFO L87 Difference]: Start difference. First operand 833 states and 2091 transitions. Second operand 10 states. [2019-08-04 21:22:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:30,740 INFO L93 Difference]: Finished difference Result 1717 states and 4102 transitions. [2019-08-04 21:22:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:30,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:30,745 INFO L225 Difference]: With dead ends: 1717 [2019-08-04 21:22:30,745 INFO L226 Difference]: Without dead ends: 1717 [2019-08-04 21:22:30,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-08-04 21:22:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 870. [2019-08-04 21:22:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-08-04 21:22:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2205 transitions. [2019-08-04 21:22:30,774 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2205 transitions. Word has length 16 [2019-08-04 21:22:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:30,775 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 2205 transitions. [2019-08-04 21:22:30,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2205 transitions. [2019-08-04 21:22:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:30,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:30,776 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:30,777 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2019-08-04 21:22:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:30,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:31,001 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-04 21:22:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:31,002 INFO L87 Difference]: Start difference. First operand 870 states and 2205 transitions. Second operand 10 states. [2019-08-04 21:22:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:33,158 INFO L93 Difference]: Finished difference Result 1453 states and 3494 transitions. [2019-08-04 21:22:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:33,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:33,162 INFO L225 Difference]: With dead ends: 1453 [2019-08-04 21:22:33,162 INFO L226 Difference]: Without dead ends: 1453 [2019-08-04 21:22:33,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-08-04 21:22:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 867. [2019-08-04 21:22:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-08-04 21:22:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2186 transitions. [2019-08-04 21:22:33,179 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 2186 transitions. Word has length 16 [2019-08-04 21:22:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:33,179 INFO L475 AbstractCegarLoop]: Abstraction has 867 states and 2186 transitions. [2019-08-04 21:22:33,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2186 transitions. [2019-08-04 21:22:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:33,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:33,181 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:33,181 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash 207486896, now seen corresponding path program 1 times [2019-08-04 21:22:33,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:33,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:33,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:33,459 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-04 21:22:33,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:33,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:33,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:33,460 INFO L87 Difference]: Start difference. First operand 867 states and 2186 transitions. Second operand 10 states. [2019-08-04 21:22:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:35,480 INFO L93 Difference]: Finished difference Result 2005 states and 4912 transitions. [2019-08-04 21:22:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:35,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:35,483 INFO L225 Difference]: With dead ends: 2005 [2019-08-04 21:22:35,483 INFO L226 Difference]: Without dead ends: 2005 [2019-08-04 21:22:35,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-08-04 21:22:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 730. [2019-08-04 21:22:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-08-04 21:22:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1839 transitions. [2019-08-04 21:22:35,500 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1839 transitions. Word has length 16 [2019-08-04 21:22:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:35,500 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1839 transitions. [2019-08-04 21:22:35,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1839 transitions. [2019-08-04 21:22:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:35,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:35,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:35,502 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1276764270, now seen corresponding path program 1 times [2019-08-04 21:22:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:35,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:35,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:35,651 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-04 21:22:35,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:35,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:35,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:35,653 INFO L87 Difference]: Start difference. First operand 730 states and 1839 transitions. Second operand 10 states. [2019-08-04 21:22:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:38,155 INFO L93 Difference]: Finished difference Result 1896 states and 4574 transitions. [2019-08-04 21:22:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:22:38,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:38,159 INFO L225 Difference]: With dead ends: 1896 [2019-08-04 21:22:38,159 INFO L226 Difference]: Without dead ends: 1896 [2019-08-04 21:22:38,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:22:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-08-04 21:22:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 733. [2019-08-04 21:22:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-08-04 21:22:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1845 transitions. [2019-08-04 21:22:38,171 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1845 transitions. Word has length 16 [2019-08-04 21:22:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:38,171 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1845 transitions. [2019-08-04 21:22:38,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1845 transitions. [2019-08-04 21:22:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:38,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:38,172 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:38,172 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1273963916, now seen corresponding path program 1 times [2019-08-04 21:22:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:38,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:38,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:38,242 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-04 21:22:38,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:38,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:38,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:38,244 INFO L87 Difference]: Start difference. First operand 733 states and 1845 transitions. Second operand 10 states. [2019-08-04 21:22:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:40,684 INFO L93 Difference]: Finished difference Result 1659 states and 3985 transitions. [2019-08-04 21:22:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:40,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:40,687 INFO L225 Difference]: With dead ends: 1659 [2019-08-04 21:22:40,688 INFO L226 Difference]: Without dead ends: 1659 [2019-08-04 21:22:40,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-08-04 21:22:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 760. [2019-08-04 21:22:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-08-04 21:22:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1925 transitions. [2019-08-04 21:22:40,699 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1925 transitions. Word has length 16 [2019-08-04 21:22:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:40,699 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 1925 transitions. [2019-08-04 21:22:40,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1925 transitions. [2019-08-04 21:22:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:40,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:40,700 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:40,700 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1274066061, now seen corresponding path program 1 times [2019-08-04 21:22:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:40,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:40,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:40,785 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-04 21:22:40,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:40,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:40,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:40,786 INFO L87 Difference]: Start difference. First operand 760 states and 1925 transitions. Second operand 10 states. [2019-08-04 21:22:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:42,290 INFO L93 Difference]: Finished difference Result 1230 states and 2946 transitions. [2019-08-04 21:22:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:42,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:42,293 INFO L225 Difference]: With dead ends: 1230 [2019-08-04 21:22:42,293 INFO L226 Difference]: Without dead ends: 1230 [2019-08-04 21:22:42,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-08-04 21:22:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 730. [2019-08-04 21:22:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-08-04 21:22:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1839 transitions. [2019-08-04 21:22:42,302 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1839 transitions. Word has length 16 [2019-08-04 21:22:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:42,303 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1839 transitions. [2019-08-04 21:22:42,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1839 transitions. [2019-08-04 21:22:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:42,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:42,304 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:42,304 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:42,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash 91368871, now seen corresponding path program 1 times [2019-08-04 21:22:42,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:42,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:42,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:42,402 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-04 21:22:42,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:42,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:42,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:42,404 INFO L87 Difference]: Start difference. First operand 730 states and 1839 transitions. Second operand 10 states. [2019-08-04 21:22:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:44,914 INFO L93 Difference]: Finished difference Result 1812 states and 4393 transitions. [2019-08-04 21:22:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:22:44,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:44,917 INFO L225 Difference]: With dead ends: 1812 [2019-08-04 21:22:44,917 INFO L226 Difference]: Without dead ends: 1812 [2019-08-04 21:22:44,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:22:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-08-04 21:22:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 727. [2019-08-04 21:22:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-08-04 21:22:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1834 transitions. [2019-08-04 21:22:44,929 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1834 transitions. Word has length 16 [2019-08-04 21:22:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:44,929 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1834 transitions. [2019-08-04 21:22:44,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1834 transitions. [2019-08-04 21:22:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:44,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:44,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:44,931 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 88568517, now seen corresponding path program 1 times [2019-08-04 21:22:44,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:44,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:44,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:45,008 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-04 21:22:45,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:45,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:45,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:45,010 INFO L87 Difference]: Start difference. First operand 727 states and 1834 transitions. Second operand 10 states. [2019-08-04 21:22:45,981 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-08-04 21:22:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:48,100 INFO L93 Difference]: Finished difference Result 1871 states and 4491 transitions. [2019-08-04 21:22:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:48,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:48,104 INFO L225 Difference]: With dead ends: 1871 [2019-08-04 21:22:48,104 INFO L226 Difference]: Without dead ends: 1871 [2019-08-04 21:22:48,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:22:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2019-08-04 21:22:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 770. [2019-08-04 21:22:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-08-04 21:22:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1959 transitions. [2019-08-04 21:22:48,116 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1959 transitions. Word has length 16 [2019-08-04 21:22:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:48,116 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1959 transitions. [2019-08-04 21:22:48,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1959 transitions. [2019-08-04 21:22:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:48,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:48,117 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:48,117 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 88670662, now seen corresponding path program 1 times [2019-08-04 21:22:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:48,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:48,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:48,179 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-04 21:22:48,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:48,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:48,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:48,180 INFO L87 Difference]: Start difference. First operand 770 states and 1959 transitions. Second operand 10 states. [2019-08-04 21:22:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:50,232 INFO L93 Difference]: Finished difference Result 1385 states and 3291 transitions. [2019-08-04 21:22:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:50,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:50,235 INFO L225 Difference]: With dead ends: 1385 [2019-08-04 21:22:50,235 INFO L226 Difference]: Without dead ends: 1385 [2019-08-04 21:22:50,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-08-04 21:22:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 736. [2019-08-04 21:22:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-08-04 21:22:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1856 transitions. [2019-08-04 21:22:50,246 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1856 transitions. Word has length 16 [2019-08-04 21:22:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:50,246 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1856 transitions. [2019-08-04 21:22:50,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1856 transitions. [2019-08-04 21:22:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:50,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:50,247 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:50,248 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 385942279, now seen corresponding path program 1 times [2019-08-04 21:22:50,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:50,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:50,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:50,447 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-04 21:22:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:50,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:50,448 INFO L87 Difference]: Start difference. First operand 736 states and 1856 transitions. Second operand 10 states. [2019-08-04 21:22:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:52,710 INFO L93 Difference]: Finished difference Result 1623 states and 3902 transitions. [2019-08-04 21:22:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:52,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:52,713 INFO L225 Difference]: With dead ends: 1623 [2019-08-04 21:22:52,713 INFO L226 Difference]: Without dead ends: 1623 [2019-08-04 21:22:52,714 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-04 21:22:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-08-04 21:22:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 649. [2019-08-04 21:22:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-08-04 21:22:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1618 transitions. [2019-08-04 21:22:52,725 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1618 transitions. Word has length 16 [2019-08-04 21:22:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:52,725 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1618 transitions. [2019-08-04 21:22:52,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1618 transitions. [2019-08-04 21:22:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:52,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:52,726 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:52,727 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash 386044424, now seen corresponding path program 1 times [2019-08-04 21:22:52,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:52,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:52,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:52,831 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-04 21:22:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:52,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:52,832 INFO L87 Difference]: Start difference. First operand 649 states and 1618 transitions. Second operand 10 states. [2019-08-04 21:22:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:54,867 INFO L93 Difference]: Finished difference Result 1299 states and 3067 transitions. [2019-08-04 21:22:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:54,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:54,870 INFO L225 Difference]: With dead ends: 1299 [2019-08-04 21:22:54,870 INFO L226 Difference]: Without dead ends: 1299 [2019-08-04 21:22:54,870 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-04 21:22:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-08-04 21:22:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 637. [2019-08-04 21:22:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-08-04 21:22:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1588 transitions. [2019-08-04 21:22:54,880 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1588 transitions. Word has length 16 [2019-08-04 21:22:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:54,880 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 1588 transitions. [2019-08-04 21:22:54,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1588 transitions. [2019-08-04 21:22:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:54,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:54,881 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:54,881 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 394958660, now seen corresponding path program 1 times [2019-08-04 21:22:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:54,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:54,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:54,943 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-04 21:22:54,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:54,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:54,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:54,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:54,944 INFO L87 Difference]: Start difference. First operand 637 states and 1588 transitions. Second operand 10 states. [2019-08-04 21:22:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:56,883 INFO L93 Difference]: Finished difference Result 1148 states and 2747 transitions. [2019-08-04 21:22:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:56,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:56,885 INFO L225 Difference]: With dead ends: 1148 [2019-08-04 21:22:56,885 INFO L226 Difference]: Without dead ends: 1148 [2019-08-04 21:22:56,886 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-04 21:22:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-08-04 21:22:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 298. [2019-08-04 21:22:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-08-04 21:22:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 699 transitions. [2019-08-04 21:22:56,892 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 699 transitions. Word has length 16 [2019-08-04 21:22:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:56,892 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 699 transitions. [2019-08-04 21:22:56,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 699 transitions. [2019-08-04 21:22:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:56,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:56,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:56,893 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -884179606, now seen corresponding path program 1 times [2019-08-04 21:22:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:56,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:56,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:56,947 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-04 21:22:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:56,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:56,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:56,948 INFO L87 Difference]: Start difference. First operand 298 states and 699 transitions. Second operand 10 states. [2019-08-04 21:22:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:58,933 INFO L93 Difference]: Finished difference Result 583 states and 1322 transitions. [2019-08-04 21:22:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:58,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:58,935 INFO L225 Difference]: With dead ends: 583 [2019-08-04 21:22:58,935 INFO L226 Difference]: Without dead ends: 583 [2019-08-04 21:22:58,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-08-04 21:22:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 287. [2019-08-04 21:22:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-04 21:22:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 665 transitions. [2019-08-04 21:22:58,940 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 665 transitions. Word has length 16 [2019-08-04 21:22:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:58,941 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 665 transitions. [2019-08-04 21:22:58,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 665 transitions. [2019-08-04 21:22:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:58,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:58,941 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:58,942 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash -886878094, now seen corresponding path program 1 times [2019-08-04 21:22:58,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:58,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:58,992 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-04 21:22:58,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:58,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:58,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:58,993 INFO L87 Difference]: Start difference. First operand 287 states and 665 transitions. Second operand 10 states. [2019-08-04 21:23:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:01,155 INFO L93 Difference]: Finished difference Result 619 states and 1366 transitions. [2019-08-04 21:23:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:23:01,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:01,157 INFO L225 Difference]: With dead ends: 619 [2019-08-04 21:23:01,157 INFO L226 Difference]: Without dead ends: 619 [2019-08-04 21:23:01,158 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-04 21:23:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-08-04 21:23:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 291. [2019-08-04 21:23:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-04 21:23:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 675 transitions. [2019-08-04 21:23:01,164 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 675 transitions. Word has length 16 [2019-08-04 21:23:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:01,164 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 675 transitions. [2019-08-04 21:23:01,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 675 transitions. [2019-08-04 21:23:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:01,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:01,166 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:01,166 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash -886877815, now seen corresponding path program 1 times [2019-08-04 21:23:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:01,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:01,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:01,447 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-04 21:23:01,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:01,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:01,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:01,448 INFO L87 Difference]: Start difference. First operand 291 states and 675 transitions. Second operand 10 states. [2019-08-04 21:23:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:03,899 INFO L93 Difference]: Finished difference Result 665 states and 1507 transitions. [2019-08-04 21:23:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:23:03,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:03,901 INFO L225 Difference]: With dead ends: 665 [2019-08-04 21:23:03,901 INFO L226 Difference]: Without dead ends: 665 [2019-08-04 21:23:03,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:23:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-08-04 21:23:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 257. [2019-08-04 21:23:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-04 21:23:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 588 transitions. [2019-08-04 21:23:03,906 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 588 transitions. Word has length 16 [2019-08-04 21:23:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:03,907 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 588 transitions. [2019-08-04 21:23:03,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 588 transitions. [2019-08-04 21:23:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:03,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:03,907 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:03,907 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash 344711637, now seen corresponding path program 1 times [2019-08-04 21:23:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:03,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:03,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:03,963 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-04 21:23:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:03,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:03,964 INFO L87 Difference]: Start difference. First operand 257 states and 588 transitions. Second operand 10 states. [2019-08-04 21:23:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:06,154 INFO L93 Difference]: Finished difference Result 634 states and 1404 transitions. [2019-08-04 21:23:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:23:06,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:06,156 INFO L225 Difference]: With dead ends: 634 [2019-08-04 21:23:06,156 INFO L226 Difference]: Without dead ends: 634 [2019-08-04 21:23:06,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:23:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-04 21:23:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 277. [2019-08-04 21:23:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-04 21:23:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 633 transitions. [2019-08-04 21:23:06,162 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 633 transitions. Word has length 16 [2019-08-04 21:23:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:06,162 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 633 transitions. [2019-08-04 21:23:06,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 633 transitions. [2019-08-04 21:23:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:06,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:06,163 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:06,163 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash 344711916, now seen corresponding path program 1 times [2019-08-04 21:23:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:06,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:06,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:06,233 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-04 21:23:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:06,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:06,235 INFO L87 Difference]: Start difference. First operand 277 states and 633 transitions. Second operand 10 states. [2019-08-04 21:23:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:08,869 INFO L93 Difference]: Finished difference Result 728 states and 1636 transitions. [2019-08-04 21:23:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:23:08,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:08,871 INFO L225 Difference]: With dead ends: 728 [2019-08-04 21:23:08,871 INFO L226 Difference]: Without dead ends: 728 [2019-08-04 21:23:08,872 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-04 21:23:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-08-04 21:23:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 259. [2019-08-04 21:23:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-04 21:23:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 592 transitions. [2019-08-04 21:23:08,876 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 592 transitions. Word has length 16 [2019-08-04 21:23:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:08,876 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 592 transitions. [2019-08-04 21:23:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 592 transitions. [2019-08-04 21:23:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:08,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:08,876 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:08,877 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 348591473, now seen corresponding path program 1 times [2019-08-04 21:23:08,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:08,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:08,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:09,005 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-04 21:23:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:09,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:09,006 INFO L87 Difference]: Start difference. First operand 259 states and 592 transitions. Second operand 10 states. [2019-08-04 21:23:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:11,706 INFO L93 Difference]: Finished difference Result 705 states and 1605 transitions. [2019-08-04 21:23:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:23:11,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:11,707 INFO L225 Difference]: With dead ends: 705 [2019-08-04 21:23:11,707 INFO L226 Difference]: Without dead ends: 705 [2019-08-04 21:23:11,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:23:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-08-04 21:23:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 253. [2019-08-04 21:23:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-04 21:23:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-04 21:23:11,713 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-04 21:23:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:11,713 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-04 21:23:11,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-04 21:23:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:11,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:11,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:11,714 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash -353600118, now seen corresponding path program 1 times [2019-08-04 21:23:11,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:11,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:11,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:11,787 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-04 21:23:11,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:11,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:11,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:11,788 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-04 21:23:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:13,349 INFO L93 Difference]: Finished difference Result 502 states and 1107 transitions. [2019-08-04 21:23:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:23:13,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:13,350 INFO L225 Difference]: With dead ends: 502 [2019-08-04 21:23:13,351 INFO L226 Difference]: Without dead ends: 502 [2019-08-04 21:23:13,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:23:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-08-04 21:23:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 292. [2019-08-04 21:23:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-04 21:23:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 665 transitions. [2019-08-04 21:23:13,356 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 665 transitions. Word has length 16 [2019-08-04 21:23:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:13,357 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 665 transitions. [2019-08-04 21:23:13,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 665 transitions. [2019-08-04 21:23:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:13,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:13,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:13,358 INFO L418 AbstractCegarLoop]: === Iteration 47 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash -353599839, now seen corresponding path program 1 times [2019-08-04 21:23:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:13,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:13,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:13,420 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-04 21:23:13,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:13,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:13,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:13,421 INFO L87 Difference]: Start difference. First operand 292 states and 665 transitions. Second operand 10 states. [2019-08-04 21:23:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:15,767 INFO L93 Difference]: Finished difference Result 625 states and 1396 transitions. [2019-08-04 21:23:15,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:23:15,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:15,769 INFO L225 Difference]: With dead ends: 625 [2019-08-04 21:23:15,769 INFO L226 Difference]: Without dead ends: 625 [2019-08-04 21:23:15,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:23:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-08-04 21:23:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 274. [2019-08-04 21:23:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-04 21:23:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 624 transitions. [2019-08-04 21:23:15,776 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 624 transitions. Word has length 16 [2019-08-04 21:23:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:15,776 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 624 transitions. [2019-08-04 21:23:15,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 624 transitions. [2019-08-04 21:23:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:15,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:15,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:15,777 INFO L418 AbstractCegarLoop]: === Iteration 48 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -349720282, now seen corresponding path program 1 times [2019-08-04 21:23:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:15,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:15,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:16,236 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-04 21:23:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:16,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:16,237 INFO L87 Difference]: Start difference. First operand 274 states and 624 transitions. Second operand 10 states. [2019-08-04 21:23:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:18,736 INFO L93 Difference]: Finished difference Result 675 states and 1517 transitions. [2019-08-04 21:23:18,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:23:18,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:18,737 INFO L225 Difference]: With dead ends: 675 [2019-08-04 21:23:18,737 INFO L226 Difference]: Without dead ends: 675 [2019-08-04 21:23:18,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:23:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-08-04 21:23:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 272. [2019-08-04 21:23:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-04 21:23:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 620 transitions. [2019-08-04 21:23:18,743 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 620 transitions. Word has length 16 [2019-08-04 21:23:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:18,743 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 620 transitions. [2019-08-04 21:23:18,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 620 transitions. [2019-08-04 21:23:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:18,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:18,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:18,744 INFO L418 AbstractCegarLoop]: === Iteration 49 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -260138745, now seen corresponding path program 1 times [2019-08-04 21:23:18,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:18,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:18,835 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-04 21:23:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:18,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:18,836 INFO L87 Difference]: Start difference. First operand 272 states and 620 transitions. Second operand 10 states. [2019-08-04 21:23:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:20,951 INFO L93 Difference]: Finished difference Result 684 states and 1550 transitions. [2019-08-04 21:23:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:23:20,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:20,953 INFO L225 Difference]: With dead ends: 684 [2019-08-04 21:23:20,953 INFO L226 Difference]: Without dead ends: 684 [2019-08-04 21:23:20,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:23:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-08-04 21:23:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 286. [2019-08-04 21:23:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-08-04 21:23:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 650 transitions. [2019-08-04 21:23:20,959 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 650 transitions. Word has length 16 [2019-08-04 21:23:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:20,959 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 650 transitions. [2019-08-04 21:23:20,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 650 transitions. [2019-08-04 21:23:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:20,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:20,960 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:20,960 INFO L418 AbstractCegarLoop]: === Iteration 50 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1302531536, now seen corresponding path program 1 times [2019-08-04 21:23:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:20,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:20,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:21,961 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-04 21:23:21,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:21,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:21,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:21,962 INFO L87 Difference]: Start difference. First operand 286 states and 650 transitions. Second operand 10 states. [2019-08-04 21:23:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:24,106 INFO L93 Difference]: Finished difference Result 980 states and 2250 transitions. [2019-08-04 21:23:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:23:24,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:24,110 INFO L225 Difference]: With dead ends: 980 [2019-08-04 21:23:24,110 INFO L226 Difference]: Without dead ends: 980 [2019-08-04 21:23:24,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:23:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-08-04 21:23:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 286. [2019-08-04 21:23:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-08-04 21:23:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 650 transitions. [2019-08-04 21:23:24,118 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 650 transitions. Word has length 16 [2019-08-04 21:23:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:24,118 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 650 transitions. [2019-08-04 21:23:24,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 650 transitions. [2019-08-04 21:23:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:24,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:24,119 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:24,119 INFO L418 AbstractCegarLoop]: === Iteration 51 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1302531815, now seen corresponding path program 1 times [2019-08-04 21:23:24,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:24,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:24,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:24,342 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-04 21:23:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:24,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:24,344 INFO L87 Difference]: Start difference. First operand 286 states and 650 transitions. Second operand 10 states. [2019-08-04 21:23:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:27,252 INFO L93 Difference]: Finished difference Result 1215 states and 2797 transitions. [2019-08-04 21:23:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:23:27,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:27,255 INFO L225 Difference]: With dead ends: 1215 [2019-08-04 21:23:27,255 INFO L226 Difference]: Without dead ends: 1215 [2019-08-04 21:23:27,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:23:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-08-04 21:23:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 268. [2019-08-04 21:23:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-04 21:23:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 609 transitions. [2019-08-04 21:23:27,262 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 609 transitions. Word has length 16 [2019-08-04 21:23:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:27,262 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 609 transitions. [2019-08-04 21:23:27,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 609 transitions. [2019-08-04 21:23:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:27,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:27,263 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:27,263 INFO L418 AbstractCegarLoop]: === Iteration 52 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:27,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1306411372, now seen corresponding path program 1 times [2019-08-04 21:23:27,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:27,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:27,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:27,323 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-04 21:23:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:27,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:27,325 INFO L87 Difference]: Start difference. First operand 268 states and 609 transitions. Second operand 10 states. [2019-08-04 21:23:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:30,314 INFO L93 Difference]: Finished difference Result 1303 states and 3013 transitions. [2019-08-04 21:23:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:23:30,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:30,316 INFO L225 Difference]: With dead ends: 1303 [2019-08-04 21:23:30,316 INFO L226 Difference]: Without dead ends: 1303 [2019-08-04 21:23:30,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:23:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-08-04 21:23:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 266. [2019-08-04 21:23:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-08-04 21:23:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 605 transitions. [2019-08-04 21:23:30,324 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 605 transitions. Word has length 16 [2019-08-04 21:23:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:30,324 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 605 transitions. [2019-08-04 21:23:30,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 605 transitions. [2019-08-04 21:23:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:30,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:30,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:30,326 INFO L418 AbstractCegarLoop]: === Iteration 53 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1395992909, now seen corresponding path program 1 times [2019-08-04 21:23:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:30,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:30,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:30,581 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-04 21:23:30,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:30,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:30,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:30,582 INFO L87 Difference]: Start difference. First operand 266 states and 605 transitions. Second operand 10 states. [2019-08-04 21:23:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:32,901 INFO L93 Difference]: Finished difference Result 1152 states and 2667 transitions. [2019-08-04 21:23:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:23:32,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:32,904 INFO L225 Difference]: With dead ends: 1152 [2019-08-04 21:23:32,904 INFO L226 Difference]: Without dead ends: 1152 [2019-08-04 21:23:32,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:23:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-08-04 21:23:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 247. [2019-08-04 21:23:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-08-04 21:23:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 563 transitions. [2019-08-04 21:23:32,910 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 563 transitions. Word has length 16 [2019-08-04 21:23:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:32,910 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 563 transitions. [2019-08-04 21:23:32,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 563 transitions. [2019-08-04 21:23:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:32,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:32,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:32,911 INFO L418 AbstractCegarLoop]: === Iteration 54 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 451559940, now seen corresponding path program 1 times [2019-08-04 21:23:32,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:32,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:32,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:32,957 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-04 21:23:32,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:32,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:32,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:32,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:32,958 INFO L87 Difference]: Start difference. First operand 247 states and 563 transitions. Second operand 10 states. [2019-08-04 21:23:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:34,427 INFO L93 Difference]: Finished difference Result 501 states and 1169 transitions. [2019-08-04 21:23:34,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:23:34,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:34,428 INFO L225 Difference]: With dead ends: 501 [2019-08-04 21:23:34,428 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:23:34,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:23:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:23:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:23:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:23:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:23:34,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-08-04 21:23:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:34,430 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:23:34,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:23:34,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:23:34,436 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:23:34 BoogieIcfgContainer [2019-08-04 21:23:34,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:23:34,438 INFO L168 Benchmark]: Toolchain (without parser) took 126966.44 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 109.7 MB in the beginning and 141.4 MB in the end (delta: -31.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:34,438 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:23:34,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 141.0 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:34,440 INFO L168 Benchmark]: Boogie Preprocessor took 32.66 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:34,440 INFO L168 Benchmark]: RCFGBuilder took 841.62 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 81.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:34,441 INFO L168 Benchmark]: TraceAbstraction took 126044.37 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 81.2 MB in the beginning and 141.4 MB in the end (delta: -60.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:34,443 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.20 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 141.0 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.66 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.62 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 81.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126044.37 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 81.2 MB in the beginning and 141.4 MB in the end (delta: -60.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 277]: 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: 264]: 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: 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: 154]: 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: 222]: 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: 364]: 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: 284]: 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 - 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, 125.9s OverallTime, 54 OverallIterations, 2 TraceHistogramMax, 116.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15251 SDtfs, 42587 SDslu, 50868 SDs, 0 SdLazy, 95828 SolverSat, 9774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 1272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6566 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=870occurred in iteration=28, 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.6s AutomataMinimizationTime, 54 MinimizatonAttempts, 31912 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 44362 SizeOfPredicates, 240 NumberOfNonLiveVariables, 2102 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 54 InterpolantComputations, 24 PerfectInterpolantSequences, 0/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...