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/loopAcceleration/loopWithUnreachableBranch.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:07,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:07,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:07,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:07,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:07,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:07,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:07,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:07,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:07,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:07,389 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:07,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:07,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:07,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:07,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:07,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:07,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:07,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:07,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:07,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:07,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:07,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:07,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:07,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:07,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:07,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:07,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:07,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:07,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:07,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:07,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:07,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:07,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:07,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:07,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:07,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:07,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:07,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:07,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:07,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:07,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:07,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:07,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:07,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:07,469 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:07,469 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:07,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithUnreachableBranch.bpl [2019-08-05 11:21:07,470 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithUnreachableBranch.bpl' [2019-08-05 11:21:07,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:07,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:07,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:07,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:07,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:07,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,538 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:07,538 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:07,539 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:07,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:07,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:07,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:07,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:07,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... [2019-08-05 11:21:07,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:07,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:07,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:07,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:07,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:21:07,634 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:07,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:08,010 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:08,011 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:21:08,013 INFO L202 PluginConnector]: Adding new model loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:08 BoogieIcfgContainer [2019-08-05 11:21:08,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:08,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:08,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:08,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:08,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:07" (1/2) ... [2019-08-05 11:21:08,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25deef96 and model type loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:08, skipping insertion in model container [2019-08-05 11:21:08,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:08" (2/2) ... [2019-08-05 11:21:08,043 INFO L109 eAbstractionObserver]: Analyzing ICFG loopWithUnreachableBranch.bpl [2019-08-05 11:21:08,062 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:08,069 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:21:08,088 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:21:08,128 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:08,130 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:08,130 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:08,130 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:08,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:08,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:08,131 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:08,131 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:08,131 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:21:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:21:08,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:21:08,156 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2019-08-05 11:21:08,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:08,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:08,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:08,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:08,319 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:21:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,367 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:21:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:08,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:21:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,380 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:08,380 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:08,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:21:08,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:21:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,410 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:21:08,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:21:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:21:08,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:21:08,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 945080, now seen corresponding path program 1 times [2019-08-05 11:21:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:21:08,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:08,485 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:21:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,554 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:21:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:08,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:21:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,556 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:08,556 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:21:08,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:21:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:21:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:21:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:21:08,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 11:21:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,560 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:21:08,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:21:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:08,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,561 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:21:08,561 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 29306112, now seen corresponding path program 2 times [2019-08-05 11:21:08,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:08,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:08,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:21:08,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:08,631 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 11:21:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,684 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:21:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:08,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:21:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,685 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:21:08,685 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:08,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:21:08,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:21:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,688 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:21:08,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:21:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:21:08,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,689 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:21:08,690 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash 908489519, now seen corresponding path program 1 times [2019-08-05 11:21:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:08,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:08,757 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:21:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,785 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:21:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:08,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:21:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,786 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:08,786 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:21:08,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:21:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:21:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:21:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:21:08,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:21:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,790 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:21:08,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:21:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:21:08,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,791 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:21:08,791 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1901329801, now seen corresponding path program 2 times [2019-08-05 11:21:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:21:08,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:08,954 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:21:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,998 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:21:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:21:08,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:21:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,999 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:21:09,000 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:21:09,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:21:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:21:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:21:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:21:09,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:21:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,003 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:21:09,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:21:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:21:09,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,004 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:21:09,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1188584495, now seen corresponding path program 3 times [2019-08-05 11:21:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:21:09,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:09,265 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:21:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,334 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:21:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:09,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:21:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,335 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:21:09,335 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:21:09,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:21:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:21:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:21:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:21:09,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:21:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,338 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:21:09,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:21:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:21:09,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,339 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:21:09,339 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1808320137, now seen corresponding path program 4 times [2019-08-05 11:21:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:21:09,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:09,485 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:21:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,586 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:21:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:21:09,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:21:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,587 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:21:09,587 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:21:09,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:21:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:21:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:21:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:21:09,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:21:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,591 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:21:09,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:21:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:09,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,592 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:21:09,593 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,595 INFO L82 PathProgramCache]: Analyzing trace with hash -223083217, now seen corresponding path program 5 times [2019-08-05 11:21:09,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:21:09,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:21:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:21:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:09,768 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-08-05 11:21:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,805 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:21:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:09,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:21:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,806 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:21:09,806 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:21:09,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:21:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:21:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:21:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:21:09,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:21:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,810 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:21:09,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:21:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:21:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:21:09,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,811 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:21:09,811 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1674621047, now seen corresponding path program 6 times [2019-08-05 11:21:09,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:21:09,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:21:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:21:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:09,965 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 11:21:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,193 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:21:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:21:10,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:21:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,194 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:21:10,195 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:21:10,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:21:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:21:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:21:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:21:10,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:21:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,198 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:21:10,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:21:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:21:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:21:10,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,199 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:21:10,200 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash 373911087, now seen corresponding path program 7 times [2019-08-05 11:21:10,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:21:10,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:21:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:21:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:10,384 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 11:21:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,424 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:21:10,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:21:10,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:21:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,425 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:21:10,425 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:21:10,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:21:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:21:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:21:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:21:10,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:21:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,428 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:21:10,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:21:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:21:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:21:10,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,429 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:21:10,429 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1293392009, now seen corresponding path program 8 times [2019-08-05 11:21:10,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:21:10,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:21:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:21:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:10,654 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 11:21:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,684 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:21:10,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:21:10,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:21:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,686 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:21:10,686 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:21:10,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:21:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:21:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:21:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:21:10,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:21:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,691 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:21:10,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:21:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:21:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:21:10,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,692 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:21:10,692 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1440180433, now seen corresponding path program 9 times [2019-08-05 11:21:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:21:10,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:21:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:21:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:10,925 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-08-05 11:21:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,967 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:21:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:21:10,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:21:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,968 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:21:10,968 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:21:10,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:21:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:21:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:21:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:21:10,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:21:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,972 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:21:10,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:21:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:21:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:21:10,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,973 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:21:10,973 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1695654281, now seen corresponding path program 10 times [2019-08-05 11:21:10,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:11,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:21:11,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:21:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:21:11,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:11,239 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-08-05 11:21:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,270 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:21:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:11,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-08-05 11:21:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,272 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:21:11,272 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:21:11,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:21:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:21:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:21:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:21:11,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:21:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,276 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:21:11,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:21:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:21:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:11,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,277 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 11:21:11,277 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1025408977, now seen corresponding path program 11 times [2019-08-05 11:21:11,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:11,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:21:11,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:21:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:21:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:11,561 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-08-05 11:21:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,587 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:21:11,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:11,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 11:21:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,588 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:21:11,588 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:21:11,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:21:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:21:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:21:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:21:11,592 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:21:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,593 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:21:11,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:21:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:21:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:21:11,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,593 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 11:21:11,594 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1722641033, now seen corresponding path program 12 times [2019-08-05 11:21:11,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:11,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:21:11,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:21:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:21:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:11,877 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-08-05 11:21:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,905 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:21:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:21:11,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 11:21:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,906 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:21:11,906 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:21:11,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:21:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:21:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:21:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:21:11,909 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:21:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,910 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:21:11,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:21:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:21:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:11,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,910 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 11:21:11,911 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1861998289, now seen corresponding path program 13 times [2019-08-05 11:21:11,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:21:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:21:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:21:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:12,322 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-08-05 11:21:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,563 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:21:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:21:12,566 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-08-05 11:21:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,567 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:21:12,567 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:21:12,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:21:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:21:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:21:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:21:12,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:21:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,575 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:21:12,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:21:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:21:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:21:12,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,579 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 11:21:12,579 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1887105929, now seen corresponding path program 14 times [2019-08-05 11:21:12,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:12,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:21:12,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:21:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:21:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:12,835 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-08-05 11:21:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,885 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:21:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:21:12,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-08-05 11:21:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,886 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:21:12,886 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:21:12,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:21:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:21:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:21:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:21:12,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:21:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,890 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:21:12,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:21:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:21:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:21:12,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,891 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 11:21:12,892 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1629524527, now seen corresponding path program 15 times [2019-08-05 11:21:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:21:13,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:21:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:21:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:13,111 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-08-05 11:21:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,159 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:21:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:21:13,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-08-05 11:21:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,160 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:21:13,160 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:21:13,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:21:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:21:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:21:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:21:13,164 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:21:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,164 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:21:13,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:21:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:21:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:21:13,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,165 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 11:21:13,165 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1024081033, now seen corresponding path program 16 times [2019-08-05 11:21:13,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:13,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:13,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:21:13,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:21:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:21:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:13,688 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-08-05 11:21:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,731 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:21:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:13,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-08-05 11:21:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,732 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:21:13,733 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:21:13,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:21:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:21:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:21:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:21:13,745 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:21:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,745 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:21:13,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:21:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:21:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:21:13,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,746 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 11:21:13,746 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1681474769, now seen corresponding path program 17 times [2019-08-05 11:21:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:14,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:21:14,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:21:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:21:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:14,252 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-08-05 11:21:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,299 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:21:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:21:14,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-08-05 11:21:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,300 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:21:14,301 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:21:14,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:21:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:21:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:21:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:21:14,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:21:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,315 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:21:14,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:21:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:21:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:21:14,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,316 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 11:21:14,317 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -585844105, now seen corresponding path program 18 times [2019-08-05 11:21:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:21:14,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:21:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:21:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:14,611 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-08-05 11:21:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,638 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:21:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:21:14,638 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-08-05 11:21:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,639 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:21:14,639 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:21:14,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:21:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:21:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:21:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:21:14,642 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:21:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,643 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:21:14,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:21:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:21:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:21:14,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,644 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 11:21:14,644 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash -981031889, now seen corresponding path program 19 times [2019-08-05 11:21:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:21:15,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:21:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:21:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:15,196 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-08-05 11:21:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,236 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:21:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:21:15,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-08-05 11:21:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,240 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:21:15,240 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:21:15,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:21:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:21:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:21:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:21:15,243 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:21:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,243 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:21:15,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:21:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:21:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:21:15,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,244 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 11:21:15,244 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash -346951305, now seen corresponding path program 20 times [2019-08-05 11:21:15,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:21:15,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:21:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:21:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:15,541 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-08-05 11:21:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,630 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:21:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:21:15,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-08-05 11:21:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,631 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:21:15,631 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:21:15,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:21:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:21:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:21:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:21:15,635 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:21:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,635 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:21:15,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:21:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:21:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:21:15,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,636 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 11:21:15,637 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2129677615, now seen corresponding path program 21 times [2019-08-05 11:21:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:16,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:21:16,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:21:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:21:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:16,119 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-08-05 11:21:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,188 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:21:16,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:21:16,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-08-05 11:21:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,189 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:21:16,190 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:21:16,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:21:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:21:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:21:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:21:16,194 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:21:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,194 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:21:16,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:21:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:21:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:21:16,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,195 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 11:21:16,196 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1595762807, now seen corresponding path program 22 times [2019-08-05 11:21:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:16,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:21:16,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:21:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:21:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:16,523 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-08-05 11:21:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,595 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:21:16,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:21:16,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-08-05 11:21:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,597 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:21:16,597 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:21:16,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:21:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:21:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:21:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:21:16,600 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:21:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,600 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:21:16,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:21:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:21:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:16,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,601 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-08-05 11:21:16,602 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2070694353, now seen corresponding path program 23 times [2019-08-05 11:21:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:17,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:21:17,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:21:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:21:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:17,452 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-08-05 11:21:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,541 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:21:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:21:17,541 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-08-05 11:21:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,542 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:21:17,542 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:21:17,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:21:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:21:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:21:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:21:17,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:21:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,546 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:21:17,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:21:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:21:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:21:17,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,547 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-08-05 11:21:17,548 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 233250679, now seen corresponding path program 24 times [2019-08-05 11:21:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:21:18,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:21:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:21:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:18,159 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-08-05 11:21:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,313 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:21:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:21:18,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-08-05 11:21:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,315 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:21:18,315 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:21:18,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:21:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:21:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:21:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:21:18,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:21:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,319 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:21:18,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:21:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:21:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:18,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,320 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-08-05 11:21:18,321 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1358897361, now seen corresponding path program 25 times [2019-08-05 11:21:18,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:21:19,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:21:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:21:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:19,113 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-08-05 11:21:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,180 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:21:19,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:21:19,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-08-05 11:21:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,181 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:21:19,181 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:21:19,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:21:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:21:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:21:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:21:19,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:21:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,185 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:21:19,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:21:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:21:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:19,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,186 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-08-05 11:21:19,186 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 824120951, now seen corresponding path program 26 times [2019-08-05 11:21:19,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:21:19,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:21:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:21:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:19,636 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-08-05 11:21:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,677 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:21:19,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:21:19,677 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-08-05 11:21:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,678 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:21:19,678 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:21:19,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:21:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:21:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:21:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:21:19,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:21:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,682 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:21:19,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:21:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:21:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:19,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,683 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-08-05 11:21:19,684 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -221788113, now seen corresponding path program 27 times [2019-08-05 11:21:19,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:21,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:21:21,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:21:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:21:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:21,202 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-08-05 11:21:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,251 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:21:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:21:21,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-08-05 11:21:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,252 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:21:21,252 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:21:21,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:21:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:21:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:21:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:21:21,256 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:21:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,256 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:21:21,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:21:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:21:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:21:21,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,257 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-08-05 11:21:21,257 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1714769271, now seen corresponding path program 28 times [2019-08-05 11:21:21,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:21:21,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:21:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:21:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:21,640 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-08-05 11:21:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,905 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:21:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:21,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-08-05 11:21:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,908 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:21:21,908 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:21:21,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:21:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:21:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:21:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:21:21,911 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:21:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,911 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:21:21,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:21:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:21:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:21:21,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,912 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-08-05 11:21:21,912 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1618506031, now seen corresponding path program 29 times [2019-08-05 11:21:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:22,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:21:22,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:21:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:21:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:22,781 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-08-05 11:21:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:22,830 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:21:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:21:22,831 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-08-05 11:21:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:22,832 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:21:22,832 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:21:22,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:21:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:21:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:21:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:21:22,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:21:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:22,836 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:21:22,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:21:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:21:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:21:22,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:22,837 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-08-05 11:21:22,837 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1365654409, now seen corresponding path program 30 times [2019-08-05 11:21:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:22,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:21:22,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:23,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:21:23,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:21:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:21:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:23,291 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-08-05 11:21:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,351 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:21:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:23,351 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-08-05 11:21:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,352 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:21:23,352 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:21:23,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:21:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:21:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:21:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:21:23,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:21:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,357 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:21:23,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:21:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:21:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:21:23,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,357 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-08-05 11:21:23,358 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 614652463, now seen corresponding path program 31 times [2019-08-05 11:21:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:21:23,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:21:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:21:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:23,885 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-08-05 11:21:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,929 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:21:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:21:23,929 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-08-05 11:21:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,930 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:21:23,930 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:21:23,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:21:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:21:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:21:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:21:23,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:21:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,934 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:21:23,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:21:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:21:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:21:23,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,934 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-08-05 11:21:23,934 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1874623351, now seen corresponding path program 32 times [2019-08-05 11:21:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:24,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:21:24,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:21:24,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:21:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:24,471 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-08-05 11:21:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,534 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:21:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:21:24,534 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-08-05 11:21:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,535 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:21:24,535 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:21:24,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:21:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:21:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:21:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:21:24,539 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:21:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,539 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:21:24,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:21:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:21:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:21:24,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,540 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-08-05 11:21:24,540 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2015952081, now seen corresponding path program 33 times [2019-08-05 11:21:24,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:21:25,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:21:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:21:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:25,116 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-08-05 11:21:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,165 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:21:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:21:25,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-08-05 11:21:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,167 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:21:25,167 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:21:25,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:21:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:21:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:21:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:21:25,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:21:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,171 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:21:25,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:21:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:21:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:21:25,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,172 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-08-05 11:21:25,173 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1930261111, now seen corresponding path program 34 times [2019-08-05 11:21:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:25,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:21:25,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:21:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:21:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:25,758 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-08-05 11:21:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,833 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:21:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:21:25,834 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-08-05 11:21:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,835 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:21:25,835 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:21:25,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:21:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:21:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:21:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:21:25,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:21:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,838 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:21:25,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:21:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:21:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:21:25,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,839 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-08-05 11:21:25,839 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash -291181521, now seen corresponding path program 35 times [2019-08-05 11:21:25,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:28,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:21:28,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:21:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:21:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:28,450 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-08-05 11:21:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:28,502 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:21:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:21:28,503 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-08-05 11:21:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:28,504 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:21:28,504 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:21:28,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:21:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:21:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:21:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:21:28,507 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:21:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:28,507 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:21:28,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:21:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:21:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:21:28,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:28,508 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-08-05 11:21:28,508 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -436426377, now seen corresponding path program 36 times [2019-08-05 11:21:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:28,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:21:28,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:29,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:21:29,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:21:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:21:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:29,339 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-08-05 11:21:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,389 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:21:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:21:29,390 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-08-05 11:21:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,390 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:21:29,391 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:21:29,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:21:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:21:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:21:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:21:29,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:21:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,394 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:21:29,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:21:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:21:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:21:29,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,395 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-08-05 11:21:29,395 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -644049617, now seen corresponding path program 37 times [2019-08-05 11:21:29,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:21:30,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:21:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:21:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:30,120 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-08-05 11:21:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,169 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:21:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:21:30,170 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-08-05 11:21:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,171 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:21:30,171 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:21:30,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:21:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:21:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:21:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:21:30,174 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:21:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,174 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:21:30,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:21:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:21:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:21:30,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,175 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-08-05 11:21:30,175 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1509564535, now seen corresponding path program 38 times [2019-08-05 11:21:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:30,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:21:30,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:21:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:21:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:30,965 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-08-05 11:21:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,036 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:21:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:21:31,037 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-08-05 11:21:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,038 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:21:31,038 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:21:31,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:21:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:21:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:21:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:21:31,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:21:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,041 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:21:31,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:21:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:21:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:21:31,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,041 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-08-05 11:21:31,042 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash -447873489, now seen corresponding path program 39 times [2019-08-05 11:21:31,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:31,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:21:31,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:21:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:21:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:31,919 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-08-05 11:21:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,973 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:21:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:21:31,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-08-05 11:21:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,974 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:21:31,975 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:21:31,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:21:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:21:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:21:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:21:31,977 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:21:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,978 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:21:31,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:21:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:21:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:21:31,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,978 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-08-05 11:21:31,978 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -998910089, now seen corresponding path program 40 times [2019-08-05 11:21:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:32,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:32,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:21:32,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:21:32,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:21:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:32,987 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-08-05 11:21:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,070 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:21:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:21:33,071 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-08-05 11:21:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,072 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:21:33,072 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:21:33,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:21:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:21:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:21:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:21:33,075 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:21:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,076 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:21:33,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:21:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:21:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:21:33,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,076 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-08-05 11:21:33,076 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -901175505, now seen corresponding path program 41 times [2019-08-05 11:21:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:33,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:21:33,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:21:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:21:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:33,823 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-08-05 11:21:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,888 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:21:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:21:33,889 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-08-05 11:21:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,889 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:21:33,890 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:21:33,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:21:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:21:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:21:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:21:33,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:21:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,894 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:21:33,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:21:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:21:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:21:33,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,894 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-08-05 11:21:33,895 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2128596599, now seen corresponding path program 42 times [2019-08-05 11:21:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:34,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:34,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:21:34,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:21:34,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:21:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:21:34,740 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-08-05 11:21:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,841 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:21:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:21:34,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-08-05 11:21:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,843 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:21:34,843 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:21:34,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:21:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:21:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:21:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:21:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:21:34,846 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:21:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,846 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:21:34,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:21:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:21:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:21:34,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,847 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-08-05 11:21:34,847 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1562251311, now seen corresponding path program 43 times [2019-08-05 11:21:34,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:35,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:21:35,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:21:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:21:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:35,609 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-08-05 11:21:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:35,673 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:21:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:21:35,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-08-05 11:21:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:35,675 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:21:35,675 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:21:35,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:21:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:21:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:21:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:21:35,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:21:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:35,678 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:21:35,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:21:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:21:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:21:35,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:35,678 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-08-05 11:21:35,678 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1185416567, now seen corresponding path program 44 times [2019-08-05 11:21:35,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:35,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:21:35,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:36,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:36,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:21:36,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:21:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:21:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:36,646 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-08-05 11:21:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,922 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:21:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:21:36,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-08-05 11:21:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,923 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:21:36,924 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:21:36,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:21:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:21:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:21:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:21:36,927 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:21:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,927 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:21:36,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:21:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:21:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:21:36,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,928 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-08-05 11:21:36,928 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1906525905, now seen corresponding path program 45 times [2019-08-05 11:21:36,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:38,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:21:38,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:21:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:21:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:38,094 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-08-05 11:21:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,163 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:21:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:21:38,165 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-08-05 11:21:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,165 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:21:38,165 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:21:38,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:21:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:21:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:21:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:21:38,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:21:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,168 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:21:38,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:21:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:21:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:21:38,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,169 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-08-05 11:21:38,169 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1027505271, now seen corresponding path program 46 times [2019-08-05 11:21:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:39,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:39,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:21:39,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:21:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:21:39,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:39,268 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-08-05 11:21:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:39,404 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:21:39,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:21:39,405 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-08-05 11:21:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:39,406 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:21:39,406 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:21:39,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:21:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:21:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:21:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:21:39,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:21:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:39,410 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:21:39,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:21:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:21:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:21:39,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:39,410 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-08-05 11:21:39,411 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158511, now seen corresponding path program 47 times [2019-08-05 11:21:39,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:39,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:21:39,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:21:40,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:21:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:21:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:40,337 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-08-05 11:21:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:40,420 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:21:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:21:40,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-08-05 11:21:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:40,421 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:21:40,421 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:21:40,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:21:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:21:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:21:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:21:40,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:21:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:40,425 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:21:40,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:21:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:21:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:21:40,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:40,426 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-08-05 11:21:40,426 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash -401394825, now seen corresponding path program 48 times [2019-08-05 11:21:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:40,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:21:40,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:41,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:41,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:21:41,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:21:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:21:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:41,392 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-08-05 11:21:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:41,468 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:21:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:21:41,468 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-08-05 11:21:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:41,469 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:21:41,470 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:21:41,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:21:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:21:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:21:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:21:41,472 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:21:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:41,472 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:21:41,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:21:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:21:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:21:41,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:41,473 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-08-05 11:21:41,473 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash 441928495, now seen corresponding path program 49 times [2019-08-05 11:21:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:41,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:21:41,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:21:43,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:21:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:21:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:43,149 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-08-05 11:21:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:43,267 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:21:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:21:43,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-08-05 11:21:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:43,268 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:21:43,268 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:21:43,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:21:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:21:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:21:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:21:43,271 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:21:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:43,271 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:21:43,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:21:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:21:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:21:43,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:43,272 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-08-05 11:21:43,272 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash 815147639, now seen corresponding path program 50 times [2019-08-05 11:21:43,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:43,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:21:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:44,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:21:44,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:21:44,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:21:44,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:44,718 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-08-05 11:21:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:44,819 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:21:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:21:44,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-08-05 11:21:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:44,821 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:21:44,821 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:21:44,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:21:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:21:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:21:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:21:44,824 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:21:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:44,824 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:21:44,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:21:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:21:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:21:44,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:44,825 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-08-05 11:21:44,825 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash -499960785, now seen corresponding path program 51 times [2019-08-05 11:21:44,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:44,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:21:44,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:21:45,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:21:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:21:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:45,942 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-08-05 11:21:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:46,040 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:21:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:21:46,041 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-08-05 11:21:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:46,041 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:21:46,042 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:21:46,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:21:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:21:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:21:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:21:46,045 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:21:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:46,045 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:21:46,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:21:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:21:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:21:46,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:46,046 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-08-05 11:21:46,046 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1681351031, now seen corresponding path program 52 times [2019-08-05 11:21:46,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:46,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:21:46,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:47,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:47,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:21:47,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:21:47,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:21:47,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:21:47,262 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-08-05 11:21:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:47,345 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:21:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:21:47,345 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-08-05 11:21:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:47,346 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:21:47,346 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:21:47,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:21:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:21:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:21:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:21:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:21:47,349 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:21:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:47,349 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:21:47,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:21:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:21:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:21:47,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:47,350 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-08-05 11:21:47,350 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 582540591, now seen corresponding path program 53 times [2019-08-05 11:21:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:21:47,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:21:48,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:21:48,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:21:48,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:48,925 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-08-05 11:21:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:48,998 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:21:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:21:48,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-08-05 11:21:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:49,000 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:21:49,000 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:21:49,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:21:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:21:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:21:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:21:49,003 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:21:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:49,003 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:21:49,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:21:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:21:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:21:49,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:49,004 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-08-05 11:21:49,004 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 879155319, now seen corresponding path program 54 times [2019-08-05 11:21:49,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:49,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:21:49,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:50,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:21:50,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:21:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:21:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:21:50,158 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-08-05 11:21:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:50,264 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:21:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:21:50,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-08-05 11:21:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:50,266 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:21:50,266 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:21:50,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:21:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:21:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:21:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:21:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:21:50,269 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:21:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:50,269 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:21:50,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:21:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:21:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:21:50,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:50,270 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-08-05 11:21:50,270 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1484277295, now seen corresponding path program 55 times [2019-08-05 11:21:50,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:50,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:21:50,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:51,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:21:51,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:21:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:21:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:21:51,471 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-08-05 11:21:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,568 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:21:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:21:51,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-08-05 11:21:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,569 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:21:51,569 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:21:51,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:21:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:21:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:21:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:21:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:21:51,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:21:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,572 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:21:51,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:21:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:21:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:21:51,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,573 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-08-05 11:21:51,573 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1231777929, now seen corresponding path program 56 times [2019-08-05 11:21:51,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:52,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:52,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:21:52,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:21:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:21:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:52,956 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-08-05 11:21:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,095 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:21:53,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:21:53,096 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-08-05 11:21:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,096 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:21:53,096 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:21:53,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:21:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:21:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:21:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:21:53,098 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:21:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,098 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:21:53,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:21:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:21:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:21:53,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,099 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-08-05 11:21:53,099 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash 469856047, now seen corresponding path program 57 times [2019-08-05 11:21:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:54,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:21:54,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:21:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:21:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:54,533 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-08-05 11:21:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:54,623 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:21:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:21:54,623 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-08-05 11:21:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:54,624 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:21:54,624 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:21:54,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:21:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:21:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:21:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:21:54,627 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:21:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:54,627 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:21:54,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:21:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:21:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:21:54,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:54,628 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-08-05 11:21:54,628 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1680901751, now seen corresponding path program 58 times [2019-08-05 11:21:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:54,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:21:54,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:21:56,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:21:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:21:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:21:56,005 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-08-05 11:21:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,114 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:21:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:21:56,114 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-08-05 11:21:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,115 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:21:56,115 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:21:56,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:21:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:21:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:21:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:21:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:21:56,119 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:21:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,119 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:21:56,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:21:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:21:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:21:56,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,120 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-08-05 11:21:56,120 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 568612911, now seen corresponding path program 59 times [2019-08-05 11:21:56,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:57,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:57,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:21:57,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:21:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:21:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:57,452 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-08-05 11:21:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,553 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:21:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:21:57,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-08-05 11:21:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,554 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:21:57,554 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:21:57,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:21:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:21:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:21:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:21:57,557 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:21:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:57,558 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:21:57,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:21:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:21:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:21:57,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:57,558 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-08-05 11:21:57,559 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:57,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash 447397239, now seen corresponding path program 60 times [2019-08-05 11:21:57,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:57,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:21:57,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:59,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:59,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:21:59,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:21:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:21:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:59,264 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 64 states. [2019-08-05 11:21:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,354 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:21:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:21:59,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-08-05 11:21:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,355 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:21:59,355 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:21:59,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:21:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:21:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:21:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:21:59,358 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:21:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,359 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:21:59,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:21:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:21:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:21:59,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,359 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-08-05 11:21:59,360 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 984678703, now seen corresponding path program 61 times [2019-08-05 11:21:59,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:00,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:00,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:22:00,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:22:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:22:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:22:00,802 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 65 states. [2019-08-05 11:22:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:00,896 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:22:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:22:00,896 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-08-05 11:22:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:00,897 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:22:00,897 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:22:00,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:22:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:22:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:22:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:22:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:22:00,900 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:22:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:00,900 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:22:00,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:22:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:22:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:22:00,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:00,901 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-08-05 11:22:00,901 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 460534903, now seen corresponding path program 62 times [2019-08-05 11:22:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:00,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:22:00,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:02,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:22:02,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:22:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:22:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:22:02,399 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2019-08-05 11:22:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,501 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:22:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:22:02,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-08-05 11:22:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,502 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:22:02,503 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:22:02,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:22:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:22:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:22:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:22:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:22:02,507 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:22:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,507 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:22:02,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:22:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:22:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:22:02,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,508 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-08-05 11:22:02,508 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1391946287, now seen corresponding path program 63 times [2019-08-05 11:22:02,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:04,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:04,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:22:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:22:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:22:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:22:04,366 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 67 states. [2019-08-05 11:22:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:04,479 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:22:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:22:04,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-08-05 11:22:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:04,480 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:22:04,480 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:22:04,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:22:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:22:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:22:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:22:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:22:04,482 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:22:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:04,482 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:22:04,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:22:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:22:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:22:04,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:04,483 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-08-05 11:22:04,483 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash 200928119, now seen corresponding path program 64 times [2019-08-05 11:22:04,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:04,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:22:04,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:06,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:06,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:22:06,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:22:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:22:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:06,183 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 68 states. [2019-08-05 11:22:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:06,266 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:22:06,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:22:06,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-08-05 11:22:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:06,268 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:22:06,268 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:22:06,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:22:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:22:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:22:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:22:06,270 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:22:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:06,271 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:22:06,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:22:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:22:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:22:06,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:06,271 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-08-05 11:22:06,272 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1934070575, now seen corresponding path program 65 times [2019-08-05 11:22:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:06,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:22:06,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:07,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:07,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:22:07,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:22:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:22:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:07,878 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 69 states. [2019-08-05 11:22:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:07,972 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:22:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:22:07,973 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-08-05 11:22:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:07,974 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:22:07,974 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:22:07,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:22:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:22:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:22:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:22:07,977 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:22:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:07,977 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:22:07,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:22:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:22:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:22:07,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:07,977 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-08-05 11:22:07,978 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash -173088137, now seen corresponding path program 66 times [2019-08-05 11:22:07,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:07,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:22:07,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:09,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:09,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:22:09,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:22:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:22:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:22:09,775 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 70 states. [2019-08-05 11:22:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:09,880 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:22:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:22:09,881 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-08-05 11:22:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:09,882 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:22:09,882 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:22:09,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:22:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:22:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:22:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:22:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:22:09,885 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:22:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:09,885 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:22:09,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:22:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:22:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:22:09,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:09,886 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-08-05 11:22:09,887 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1070498769, now seen corresponding path program 67 times [2019-08-05 11:22:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:09,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:22:09,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:22:12,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:22:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:22:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:12,776 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 71 states. [2019-08-05 11:22:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:12,862 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:22:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:22:12,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-08-05 11:22:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:12,863 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:22:12,863 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:22:12,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:22:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:22:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:22:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:22:12,866 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:22:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:12,867 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:22:12,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:22:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:22:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:22:12,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:12,867 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-08-05 11:22:12,868 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1174542711, now seen corresponding path program 68 times [2019-08-05 11:22:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:12,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:22:12,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:22:15,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:22:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:22:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:15,144 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 72 states. [2019-08-05 11:22:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:15,272 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:22:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:22:15,272 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-08-05 11:22:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:15,273 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:22:15,273 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:22:15,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:22:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:22:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:22:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:22:15,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:22:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:15,276 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:22:15,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:22:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:22:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:22:15,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:15,277 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-08-05 11:22:15,277 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2051351855, now seen corresponding path program 69 times [2019-08-05 11:22:15,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:15,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:22:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:22:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:22:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:22:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:17,019 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 73 states. [2019-08-05 11:22:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:17,152 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:22:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:22:17,153 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-08-05 11:22:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:17,154 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:22:17,154 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:22:17,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:22:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:22:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:22:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:22:17,157 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:22:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:17,158 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:22:17,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:22:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:22:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:22:17,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:17,159 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-08-05 11:22:17,159 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash -832335753, now seen corresponding path program 70 times [2019-08-05 11:22:17,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:17,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:22:17,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:22:19,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:22:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:22:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:19,245 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 74 states. [2019-08-05 11:22:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:19,430 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:22:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:22:19,431 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-08-05 11:22:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:19,432 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:22:19,432 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:22:19,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:22:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:22:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:22:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:22:19,436 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:22:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:19,436 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:22:19,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:22:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:22:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:22:19,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:19,437 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-08-05 11:22:19,437 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash -32338385, now seen corresponding path program 71 times [2019-08-05 11:22:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:19,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:22:19,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:22:21,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:22:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:22:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:21,447 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 75 states. [2019-08-05 11:22:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:21,572 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:22:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:22:21,572 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-08-05 11:22:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:21,573 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:22:21,573 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:22:21,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:22:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:22:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:22:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:22:21,577 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:22:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:21,577 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:22:21,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:22:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:22:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:22:21,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:21,578 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-08-05 11:22:21,578 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1002223753, now seen corresponding path program 72 times [2019-08-05 11:22:21,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:21,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:22:21,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:23,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:23,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:22:23,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:22:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:22:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:23,466 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 76 states. [2019-08-05 11:22:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:23,784 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:22:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:22:23,785 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-08-05 11:22:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:23,785 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:22:23,785 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:22:23,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:22:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:22:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:22:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:22:23,787 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:22:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:23,788 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:22:23,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:22:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:22:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:22:23,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:23,789 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-08-05 11:22:23,789 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1003899089, now seen corresponding path program 73 times [2019-08-05 11:22:23,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:22:23,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:22:25,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:22:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:22:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:25,947 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 77 states. [2019-08-05 11:22:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:26,047 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:22:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:22:26,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-08-05 11:22:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:26,048 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:22:26,048 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:22:26,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:22:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:22:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:22:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:22:26,052 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:22:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:26,053 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:22:26,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:22:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:22:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:22:26,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:26,053 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-08-05 11:22:26,054 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:26,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1055834505, now seen corresponding path program 74 times [2019-08-05 11:22:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:26,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:22:26,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:28,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:28,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:22:28,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:22:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:22:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:28,419 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 78 states. [2019-08-05 11:22:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:28,563 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:22:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:22:28,564 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-08-05 11:22:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:28,565 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:22:28,565 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:22:28,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:22:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:22:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:22:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:22:28,568 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:22:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:28,568 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:22:28,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:22:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:22:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:22:28,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:28,569 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-08-05 11:22:28,569 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1629134895, now seen corresponding path program 75 times [2019-08-05 11:22:28,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:28,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:22:28,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:22:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:22:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:22:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:31,003 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 79 states. [2019-08-05 11:22:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:31,293 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:22:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:22:31,294 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-08-05 11:22:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:31,295 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:22:31,295 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:22:31,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:22:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:22:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:22:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:22:31,298 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:22:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:31,298 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:22:31,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:22:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:22:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:22:31,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:31,299 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-08-05 11:22:31,299 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:31,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1036159625, now seen corresponding path program 76 times [2019-08-05 11:22:31,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:22:31,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:33,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:22:33,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:22:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:22:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:33,349 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 80 states. [2019-08-05 11:22:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:33,462 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:22:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:22:33,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-08-05 11:22:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:33,463 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:22:33,463 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:22:33,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:22:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:22:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:22:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:22:33,466 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:22:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:33,466 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:22:33,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:22:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:22:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:22:33,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:33,467 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-08-05 11:22:33,467 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2055911121, now seen corresponding path program 77 times [2019-08-05 11:22:33,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:33,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:22:33,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:35,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:35,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:22:35,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:22:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:22:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:35,863 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 81 states. [2019-08-05 11:22:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:35,972 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:22:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:22:35,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-08-05 11:22:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:35,973 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:22:35,973 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:22:35,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:22:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:22:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:22:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:22:35,976 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:22:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:35,976 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:22:35,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:22:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:22:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:22:35,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:35,977 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-08-05 11:22:35,977 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash 691530871, now seen corresponding path program 78 times [2019-08-05 11:22:35,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:35,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:22:35,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:40,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:40,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:22:40,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:22:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:22:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:40,248 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 82 states. [2019-08-05 11:22:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:40,353 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:22:40,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:22:40,354 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-08-05 11:22:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:40,354 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:22:40,354 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:22:40,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:22:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:22:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:22:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:22:40,357 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 11:22:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:40,358 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:22:40,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:22:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:22:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:22:40,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:40,358 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-08-05 11:22:40,358 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash -37113297, now seen corresponding path program 79 times [2019-08-05 11:22:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:40,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:22:40,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:42,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:42,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:22:42,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:22:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:22:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:42,621 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 83 states. [2019-08-05 11:22:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:43,477 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:22:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:22:43,478 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-08-05 11:22:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:43,479 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:22:43,479 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:22:43,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:22:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:22:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:22:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:22:43,482 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 11:22:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:43,483 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:22:43,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:22:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:22:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:22:43,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:43,484 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-08-05 11:22:43,485 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1150246025, now seen corresponding path program 80 times [2019-08-05 11:22:43,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:43,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:22:43,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:46,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:22:46,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:22:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:22:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:46,252 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 84 states. [2019-08-05 11:22:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:46,416 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:22:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:22:46,417 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-08-05 11:22:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:46,418 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:22:46,418 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:22:46,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:22:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:22:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:22:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:22:46,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 11:22:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:46,421 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:22:46,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:22:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:22:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:22:46,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:46,422 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-08-05 11:22:46,422 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1297622225, now seen corresponding path program 81 times [2019-08-05 11:22:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:46,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:22:46,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:48,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:48,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:22:48,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:22:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:22:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:48,905 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 85 states. [2019-08-05 11:22:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:49,040 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:22:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:22:49,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-08-05 11:22:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:49,042 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:22:49,042 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:22:49,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:22:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:22:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:22:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:22:49,045 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 11:22:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:49,045 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:22:49,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:22:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:22:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:22:49,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:49,046 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-08-05 11:22:49,046 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1571317129, now seen corresponding path program 82 times [2019-08-05 11:22:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:49,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:22:49,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:51,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:51,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:22:51,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:22:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:22:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:51,627 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 86 states. [2019-08-05 11:22:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:51,806 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:22:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:22:51,806 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-08-05 11:22:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:51,807 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:22:51,807 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:22:51,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:22:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:22:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:22:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:22:51,810 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 11:22:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:22:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:22:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:22:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:22:51,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:51,812 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-08-05 11:22:51,813 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:51,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1465924561, now seen corresponding path program 83 times [2019-08-05 11:22:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:51,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:22:51,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:22:54,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:22:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:22:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:54,302 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 87 states. [2019-08-05 11:22:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:54,418 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:22:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:22:54,418 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-08-05 11:22:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:54,419 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:22:54,419 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:22:54,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:22:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:22:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:22:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:22:54,423 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 11:22:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:54,423 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:22:54,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:22:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:22:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:22:54,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:54,424 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-08-05 11:22:54,424 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1801245047, now seen corresponding path program 84 times [2019-08-05 11:22:54,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:54,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:22:54,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:57,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:57,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:22:57,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:22:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:22:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:57,120 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 88 states. [2019-08-05 11:22:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:57,309 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:22:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:22:57,309 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-08-05 11:22:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:57,310 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:22:57,310 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:22:57,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:22:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:22:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:22:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:22:57,313 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 11:22:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:57,313 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:22:57,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:22:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:22:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:22:57,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:57,314 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-08-05 11:22:57,314 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 4287791, now seen corresponding path program 85 times [2019-08-05 11:22:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:57,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:22:57,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:00,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:00,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:23:00,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:23:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:23:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:23:00,055 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 89 states. [2019-08-05 11:23:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:00,182 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:23:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:23:00,183 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-08-05 11:23:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:00,183 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:23:00,183 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:23:00,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:23:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:23:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:23:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:23:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:23:00,186 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 11:23:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:00,186 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:23:00,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:23:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:23:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:23:00,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:00,187 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-08-05 11:23:00,187 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:00,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:00,187 INFO L82 PathProgramCache]: Analyzing trace with hash 133187703, now seen corresponding path program 86 times [2019-08-05 11:23:00,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:00,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:23:00,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:02,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:02,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:23:02,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:23:02,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:23:02,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:23:02,974 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 90 states. [2019-08-05 11:23:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:03,122 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:23:03,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:23:03,123 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-08-05 11:23:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:03,124 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:23:03,124 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:23:03,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:23:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:23:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:23:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:23:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:23:03,126 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 11:23:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:03,127 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:23:03,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:23:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:23:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:23:03,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:03,127 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-08-05 11:23:03,128 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -165882321, now seen corresponding path program 87 times [2019-08-05 11:23:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:03,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:23:03,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:05,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:05,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:23:05,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:23:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:23:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:23:05,982 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 91 states. [2019-08-05 11:23:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:06,235 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:23:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:23:06,236 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-08-05 11:23:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:06,236 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:23:06,237 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:23:06,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:23:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:23:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:23:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:23:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:23:06,239 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 11:23:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:06,240 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:23:06,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:23:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:23:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:23:06,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:06,240 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-08-05 11:23:06,240 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash -847118473, now seen corresponding path program 88 times [2019-08-05 11:23:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:06,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:23:06,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:23:09,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:23:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:23:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:09,056 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 92 states. [2019-08-05 11:23:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:09,187 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:23:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:23:09,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-08-05 11:23:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:09,189 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:23:09,189 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:23:09,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:23:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:23:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:23:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:23:09,192 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 11:23:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:09,192 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:23:09,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:23:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:23:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:23:09,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:09,193 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-08-05 11:23:09,193 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash -490602705, now seen corresponding path program 89 times [2019-08-05 11:23:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:09,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:23:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:23:12,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:23:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:23:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:12,290 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 93 states. [2019-08-05 11:23:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:12,441 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:23:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:23:12,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-08-05 11:23:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:12,442 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:23:12,442 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:23:12,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:23:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:23:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:23:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:23:12,445 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 11:23:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:12,445 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:23:12,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:23:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:23:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:23:12,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:12,446 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1] [2019-08-05 11:23:12,446 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1971451511, now seen corresponding path program 90 times [2019-08-05 11:23:12,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:12,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:23:12,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:15,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:15,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:23:15,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:23:15,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:23:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:15,500 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 94 states. [2019-08-05 11:23:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:15,626 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:23:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:23:15,627 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 95 [2019-08-05 11:23:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:15,628 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:23:15,628 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:23:15,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:23:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:23:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:23:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:23:15,631 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 11:23:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:15,631 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:23:15,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:23:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:23:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:23:15,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:15,632 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1] [2019-08-05 11:23:15,632 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 985720879, now seen corresponding path program 91 times [2019-08-05 11:23:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:15,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:23:15,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:23:18,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:23:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:23:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:18,693 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 95 states. [2019-08-05 11:23:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:18,838 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:23:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:23:18,838 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 96 [2019-08-05 11:23:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:18,839 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:23:18,839 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:23:18,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:23:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:23:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:23:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:23:18,843 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:23:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:18,843 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:23:18,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:23:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:23:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:23:18,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:18,844 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1] [2019-08-05 11:23:18,844 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 492842359, now seen corresponding path program 92 times [2019-08-05 11:23:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:18,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:23:18,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:23:22,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:23:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:23:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:22,064 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 96 states. [2019-08-05 11:23:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:22,194 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:23:22,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:23:22,194 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 97 [2019-08-05 11:23:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:22,195 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:23:22,195 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:23:22,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:23:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:23:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:23:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:23:22,198 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 11:23:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:22,198 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:23:22,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:23:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:23:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:23:22,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:22,200 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1] [2019-08-05 11:23:22,200 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1901489873, now seen corresponding path program 93 times [2019-08-05 11:23:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:22,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:23:22,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:25,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:25,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:23:25,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:23:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:23:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:25,973 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 97 states. [2019-08-05 11:23:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:26,124 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:23:26,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:23:26,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 98 [2019-08-05 11:23:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:26,125 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:23:26,125 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:23:26,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:23:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:23:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:23:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:23:26,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 11:23:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:26,129 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:23:26,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:23:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:23:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:23:26,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:26,130 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1] [2019-08-05 11:23:26,130 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:26,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1183622263, now seen corresponding path program 94 times [2019-08-05 11:23:26,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:26,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:23:26,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:29,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:29,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:23:29,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:23:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:23:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:29,217 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 98 states. [2019-08-05 11:23:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:29,352 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:23:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:23:29,353 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 99 [2019-08-05 11:23:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:29,354 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:23:29,354 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:23:29,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:23:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:23:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:23:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:23:29,357 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 11:23:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:29,357 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:23:29,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:23:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:23:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:23:29,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:29,358 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1] [2019-08-05 11:23:29,358 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1962149329, now seen corresponding path program 95 times [2019-08-05 11:23:29,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:29,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:23:29,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:32,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:23:32,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:23:32,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:23:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:32,712 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 99 states. [2019-08-05 11:23:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:32,884 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:23:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:23:32,885 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 100 [2019-08-05 11:23:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:32,885 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:23:32,886 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:23:32,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:23:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:23:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:23:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:23:32,888 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 11:23:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:32,889 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:23:32,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:23:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:23:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:23:32,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:32,890 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1] [2019-08-05 11:23:32,890 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -696820873, now seen corresponding path program 96 times [2019-08-05 11:23:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:32,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:23:32,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:36,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:36,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:23:36,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:23:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:23:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:36,295 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 100 states. [2019-08-05 11:23:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:36,494 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:23:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:23:36,494 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 101 [2019-08-05 11:23:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:36,495 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:23:36,495 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:23:36,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:23:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:23:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:23:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:23:36,497 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 11:23:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:36,498 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:23:36,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:23:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:23:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:23:36,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:36,498 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1] [2019-08-05 11:23:36,499 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -126344401, now seen corresponding path program 97 times [2019-08-05 11:23:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:36,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:23:36,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:39,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:39,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:23:39,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:23:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:23:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:39,792 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 101 states. [2019-08-05 11:23:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:39,939 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:23:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:23:39,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 102 [2019-08-05 11:23:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:39,941 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:23:39,941 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:23:39,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:23:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:23:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:23:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:23:39,944 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 11:23:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:39,945 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:23:39,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:23:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:23:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:23:39,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:39,945 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1] [2019-08-05 11:23:39,945 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 378557047, now seen corresponding path program 98 times [2019-08-05 11:23:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:39,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:23:39,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:43,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:43,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:23:43,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:23:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:23:43,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:43,293 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 102 states. [2019-08-05 11:23:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:43,483 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:23:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:23:43,484 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 103 [2019-08-05 11:23:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:43,484 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:23:43,485 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:23:43,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:23:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:23:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:23:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:23:43,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 11:23:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:43,489 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:23:43,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:23:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:23:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:23:43,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:43,489 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2019-08-05 11:23:43,490 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1149367249, now seen corresponding path program 99 times [2019-08-05 11:23:43,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:43,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:23:43,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:47,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:23:47,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:23:47,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:23:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:47,193 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2019-08-05 11:23:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:47,367 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:23:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:23:47,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2019-08-05 11:23:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:47,369 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:23:47,369 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:23:47,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:23:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:23:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:23:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:23:47,373 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 11:23:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:47,373 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:23:47,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:23:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:23:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:23:47,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:47,374 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1] [2019-08-05 11:23:47,374 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:47,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1270380169, now seen corresponding path program 100 times [2019-08-05 11:23:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:47,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:23:47,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:23:50,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:23:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:23:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:23:50,952 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 104 states. [2019-08-05 11:23:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:51,190 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:23:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:23:51,191 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 105 [2019-08-05 11:23:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:51,192 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:23:51,192 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:23:51,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:23:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:23:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:23:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:23:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:23:51,195 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 11:23:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:51,195 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:23:51,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:23:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:23:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:23:51,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:51,196 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1, 1] [2019-08-05 11:23:51,196 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash -726813393, now seen corresponding path program 101 times [2019-08-05 11:23:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:51,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:23:51,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:23:54,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:23:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:23:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:54,912 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 105 states. [2019-08-05 11:23:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:55,073 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:23:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:23:55,074 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 106 [2019-08-05 11:23:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:55,074 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:23:55,075 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:23:55,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:23:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:23:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:23:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:23:55,079 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 11:23:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:55,079 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:23:55,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:23:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:23:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:23:55,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:55,080 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1, 1] [2019-08-05 11:23:55,080 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1056112521, now seen corresponding path program 102 times [2019-08-05 11:23:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:55,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:23:55,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:23:59,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:23:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:23:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:59,159 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 106 states. [2019-08-05 11:23:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:59,352 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:23:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:23:59,353 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 107 [2019-08-05 11:23:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:59,354 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:23:59,354 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:23:59,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:23:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:23:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:23:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:23:59,358 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 11:23:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:59,358 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:23:59,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:23:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:23:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:23:59,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:59,359 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1, 1] [2019-08-05 11:23:59,359 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1620516399, now seen corresponding path program 103 times [2019-08-05 11:23:59,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:59,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:23:59,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:03,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:24:03,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:24:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:24:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:24:03,177 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 107 states. [2019-08-05 11:24:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:03,347 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:24:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:24:03,348 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 108 [2019-08-05 11:24:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:03,348 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:24:03,348 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:24:03,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:24:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:24:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:24:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:24:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:24:03,351 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 11:24:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:03,352 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:24:03,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:24:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:24:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:24:03,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:03,353 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1, 1] [2019-08-05 11:24:03,353 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1303333001, now seen corresponding path program 104 times [2019-08-05 11:24:03,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:03,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:24:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:24:07,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:24:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:24:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:24:07,311 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 108 states. [2019-08-05 11:24:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:07,517 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:24:07,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:24:07,517 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 109 [2019-08-05 11:24:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:07,518 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:24:07,518 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:24:07,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:24:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:24:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:24:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:24:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:24:07,521 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 11:24:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:07,521 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:24:07,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:24:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:24:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:24:07,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:07,522 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1, 1] [2019-08-05 11:24:07,522 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1748351185, now seen corresponding path program 105 times [2019-08-05 11:24:07,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:07,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:24:07,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:24:11,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:24:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:24:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:24:11,293 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 109 states. [2019-08-05 11:24:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:11,514 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:24:11,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:24:11,515 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 110 [2019-08-05 11:24:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:11,515 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:24:11,515 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:24:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:24:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:24:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:24:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:24:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:24:11,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 11:24:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:11,518 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:24:11,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:24:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:24:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:24:11,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:11,519 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1, 1] [2019-08-05 11:24:11,519 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:11,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1635954295, now seen corresponding path program 106 times [2019-08-05 11:24:11,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:11,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:24:11,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:15,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:15,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:24:15,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:24:15,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:24:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:15,372 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 110 states. [2019-08-05 11:24:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:15,608 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:24:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:24:15,618 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 111 [2019-08-05 11:24:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:15,619 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:24:15,619 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:24:15,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:24:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:24:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:24:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:24:15,620 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 11:24:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:15,621 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:24:15,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:24:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:24:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:24:15,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:15,621 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1, 1] [2019-08-05 11:24:15,621 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash -824758225, now seen corresponding path program 107 times [2019-08-05 11:24:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:24:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:19,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:19,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:24:19,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:24:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:24:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:24:19,608 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 111 states. [2019-08-05 11:24:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:19,805 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:24:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:24:19,806 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 112 [2019-08-05 11:24:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:19,806 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:24:19,806 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:24:19,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:24:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:24:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:24:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:24:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:24:19,810 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 11:24:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:19,810 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:24:19,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:24:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:24:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:24:19,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:19,811 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1, 1] [2019-08-05 11:24:19,812 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash 202564983, now seen corresponding path program 108 times [2019-08-05 11:24:19,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:19,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:24:19,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:23,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:23,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:24:23,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:24:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:24:23,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:24:23,862 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 112 states. [2019-08-05 11:24:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:24,052 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:24:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:24:24,052 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 113 [2019-08-05 11:24:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:24,053 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:24:24,053 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:24:24,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:24:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:24:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:24:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:24:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:24:24,057 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 11:24:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:24,057 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:24:24,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:24:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:24:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:24:24,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:24,058 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1, 1] [2019-08-05 11:24:24,058 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1984813359, now seen corresponding path program 109 times [2019-08-05 11:24:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:24,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:24:24,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:28,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:24:28,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:24:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:24:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:28,146 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 113 states. [2019-08-05 11:24:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:28,365 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:24:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:24:28,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 114 [2019-08-05 11:24:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:28,366 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:24:28,366 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:24:28,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:24:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:24:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:24:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:24:28,368 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 11:24:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:28,368 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:24:28,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:24:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:24:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:24:28,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:28,369 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1, 1] [2019-08-05 11:24:28,369 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1399938167, now seen corresponding path program 110 times [2019-08-05 11:24:28,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:28,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:24:28,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:32,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:32,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:24:32,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:24:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:24:32,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:24:32,497 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 114 states. [2019-08-05 11:24:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:32,688 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:24:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:24:32,688 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 115 [2019-08-05 11:24:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:32,689 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:24:32,689 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:24:32,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:24:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:24:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:24:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:24:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:24:32,692 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 11:24:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:32,692 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:24:32,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:24:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:24:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:24:32,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:32,693 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1, 1] [2019-08-05 11:24:32,694 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 448676399, now seen corresponding path program 111 times [2019-08-05 11:24:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:24:32,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:36,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:24:36,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:24:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:24:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:36,964 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 115 states. [2019-08-05 11:24:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:37,201 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:24:37,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:24:37,201 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 116 [2019-08-05 11:24:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:37,201 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:24:37,201 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:24:37,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:24:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:24:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:24:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:24:37,204 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 11:24:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:37,204 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:24:37,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:24:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:24:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:24:37,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:37,205 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1, 1] [2019-08-05 11:24:37,205 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1024332663, now seen corresponding path program 112 times [2019-08-05 11:24:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:37,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:24:37,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:41,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:41,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:24:41,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:24:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:24:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:41,476 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 116 states. [2019-08-05 11:24:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:41,741 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:24:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:24:41,742 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 117 [2019-08-05 11:24:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:41,743 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:24:41,743 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:24:41,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:24:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:24:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:24:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:24:41,745 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 11:24:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:41,745 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:24:41,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:24:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:24:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:24:41,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:41,746 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1, 1] [2019-08-05 11:24:41,746 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1689807663, now seen corresponding path program 113 times [2019-08-05 11:24:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:41,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:24:41,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:46,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:46,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:24:46,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:24:46,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:24:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:46,127 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 117 states. [2019-08-05 11:24:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:46,345 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:24:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:24:46,345 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 118 [2019-08-05 11:24:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:46,346 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:24:46,346 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:24:46,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:24:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:24:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:24:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:24:46,349 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 11:24:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:46,349 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:24:46,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:24:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:24:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:24:46,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:46,350 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1, 1] [2019-08-05 11:24:46,350 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash 844696183, now seen corresponding path program 114 times [2019-08-05 11:24:46,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:46,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:24:46,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:24:50,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:24:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:24:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:50,700 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 118 states. [2019-08-05 11:24:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:50,911 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:24:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:24:50,911 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 119 [2019-08-05 11:24:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:50,912 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:24:50,912 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:24:50,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:24:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:24:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:24:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:24:50,915 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 11:24:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:50,915 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:24:50,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:24:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:24:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:24:50,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:50,916 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1, 1] [2019-08-05 11:24:50,916 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash 416044079, now seen corresponding path program 115 times [2019-08-05 11:24:50,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:24:50,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:55,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:55,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:24:55,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:24:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:24:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:55,446 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 119 states. [2019-08-05 11:24:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:55,653 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:24:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:24:55,653 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 120 [2019-08-05 11:24:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:55,654 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:24:55,654 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:24:55,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:24:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:24:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:24:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:24:55,657 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 11:24:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:55,657 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:24:55,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:24:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:24:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:24:55,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:55,658 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1, 1] [2019-08-05 11:24:55,658 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash 12730743, now seen corresponding path program 116 times [2019-08-05 11:24:55,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:55,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:24:55,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:25:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:25:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:25:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 11:25:00,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 11:25:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 11:25:00,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:25:00,232 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 120 states. [2019-08-05 11:25:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:25:00,466 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:25:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 11:25:00,467 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 121 [2019-08-05 11:25:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:25:00,467 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:25:00,467 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:25:00,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:25:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:25:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:25:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:25:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 11:25:00,470 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2019-08-05 11:25:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:25:00,470 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 11:25:00,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 11:25:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 11:25:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:25:00,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:25:00,471 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1, 1] [2019-08-05 11:25:00,471 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:25:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:25:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 394919215, now seen corresponding path program 117 times [2019-08-05 11:25:00,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:25:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:25:00,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 11:25:00,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:25:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:25:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:25:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-08-05 11:25:05,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-08-05 11:25:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-08-05 11:25:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 11:25:05,087 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 121 states. [2019-08-05 11:25:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:25:05,327 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 11:25:05,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 11:25:05,328 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 122 [2019-08-05 11:25:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:25:05,328 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:25:05,329 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:25:05,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 11:25:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:25:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:25:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:25:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:25:05,332 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2019-08-05 11:25:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:25:05,332 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:25:05,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-08-05 11:25:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:25:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:25:05,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:25:05,333 INFO L399 BasicCegarLoop]: trace histogram [119, 1, 1, 1, 1] [2019-08-05 11:25:05,333 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:25:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:25:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash -642140041, now seen corresponding path program 118 times [2019-08-05 11:25:05,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:25:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:25:05,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:25:05,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:25:05,443 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:25:05,443 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:25:05,447 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:25:05,447 INFO L202 PluginConnector]: Adding new model loopWithUnreachableBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:25:05 BoogieIcfgContainer [2019-08-05 11:25:05,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:25:05,450 INFO L168 Benchmark]: Toolchain (without parser) took 237944.65 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 108.0 MB in the beginning and 664.9 MB in the end (delta: -556.9 MB). Peak memory consumption was 335.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,450 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.70 ms. Allocated memory is still 138.4 MB. Free memory was 108.0 MB in the beginning and 106.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,451 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 138.4 MB. Free memory was 106.1 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,452 INFO L168 Benchmark]: RCFGBuilder took 450.08 ms. Allocated memory is still 138.4 MB. Free memory was 105.0 MB in the beginning and 94.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,453 INFO L168 Benchmark]: TraceAbstraction took 237423.39 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 94.1 MB in the beginning and 664.9 MB in the end (delta: -570.9 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:05,455 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.70 ms. Allocated memory is still 138.4 MB. Free memory was 108.0 MB in the beginning and 106.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 138.4 MB. Free memory was 106.1 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.08 ms. Allocated memory is still 138.4 MB. Free memory was 105.0 MB in the beginning and 94.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237423.39 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 94.1 MB in the beginning and 664.9 MB in the end (delta: -570.9 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 124 with TraceHistMax 119,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 124 with TraceHistMax 119,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 237.3s OverallTime, 121 OverallIterations, 119 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 481 SDtfs, 5 SDslu, 1874 SDs, 0 SdLazy, 11013 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7380 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 216.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=120, 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.2s AutomataMinimizationTime, 120 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 218.6s InterpolantComputationTime, 7500 NumberOfCodeBlocks, 7500 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 7380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764086 SizeOfPredicates, 119 NumberOfNonLiveVariables, 29286 ConjunctsInSsa, 7263 ConjunctsInUnsatCore, 120 InterpolantComputations, 2 PerfectInterpolantSequences, 3/280843 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown